/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-NoForkJoinOpt.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-4b0ab11 [2022-03-04 04:47:10,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-04 04:47:10,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-04 04:47:11,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-04 04:47:11,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-04 04:47:11,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-04 04:47:11,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-04 04:47:11,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-04 04:47:11,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-04 04:47:11,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-04 04:47:11,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-04 04:47:11,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-04 04:47:11,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-04 04:47:11,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-04 04:47:11,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-04 04:47:11,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-04 04:47:11,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-04 04:47:11,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-04 04:47:11,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-04 04:47:11,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-04 04:47:11,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-04 04:47:11,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-04 04:47:11,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-04 04:47:11,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-04 04:47:11,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-04 04:47:11,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-04 04:47:11,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-04 04:47:11,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-04 04:47:11,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-04 04:47:11,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-04 04:47:11,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-04 04:47:11,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-04 04:47:11,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-04 04:47:11,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-04 04:47:11,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-04 04:47:11,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-04 04:47:11,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-04 04:47:11,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-04 04:47:11,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-04 04:47:11,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-04 04:47:11,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-04 04:47:11,041 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-NoForkJoinOpt.epf [2022-03-04 04:47:11,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-04 04:47:11,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-04 04:47:11,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-04 04:47:11,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-04 04:47:11,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-04 04:47:11,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-04 04:47:11,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * Use SBE=true [2022-03-04 04:47:11,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-04 04:47:11,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-04 04:47:11,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-04 04:47:11,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-04 04:47:11,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-04 04:47:11,066 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-04 04:47:11,066 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-03-04 04:47:11,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-04 04:47:11,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-04 04:47:11,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-04 04:47:11,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-04 04:47:11,271 INFO L275 PluginConnector]: CDTParser initialized [2022-03-04 04:47:11,272 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-03-04 04:47:11,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36170e00c/08541953732248429706e4bb2c61a2cf/FLAGecb19e98f [2022-03-04 04:47:11,742 INFO L306 CDTParser]: Found 1 translation units. [2022-03-04 04:47:11,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-03-04 04:47:11,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36170e00c/08541953732248429706e4bb2c61a2cf/FLAGecb19e98f [2022-03-04 04:47:11,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36170e00c/08541953732248429706e4bb2c61a2cf [2022-03-04 04:47:11,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-04 04:47:11,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-04 04:47:11,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-04 04:47:11,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-04 04:47:11,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-04 04:47:11,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:47:11" (1/1) ... [2022-03-04 04:47:11,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6383f7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:11, skipping insertion in model container [2022-03-04 04:47:11,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:47:11" (1/1) ... [2022-03-04 04:47:11,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-04 04:47:11,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-04 04:47:12,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-04 04:47:12,160 INFO L203 MainTranslator]: Completed pre-run [2022-03-04 04:47:12,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-04 04:47:12,235 INFO L208 MainTranslator]: Completed translation [2022-03-04 04:47:12,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12 WrapperNode [2022-03-04 04:47:12,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-04 04:47:12,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-04 04:47:12,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-04 04:47:12,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-04 04:47:12,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,285 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-03-04 04:47:12,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-04 04:47:12,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-04 04:47:12,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-04 04:47:12,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-04 04:47:12,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-04 04:47:12,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-04 04:47:12,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-04 04:47:12,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-04 04:47:12,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (1/1) ... [2022-03-04 04:47:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-04 04:47:12,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:12,344 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-03-04 04:47:12,353 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-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-04 04:47:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-04 04:47:12,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-04 04:47:12,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-04 04:47:12,374 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-04 04:47:12,506 INFO L234 CfgBuilder]: Building ICFG [2022-03-04 04:47:12,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-04 04:47:12,709 INFO L275 CfgBuilder]: Performing block encoding [2022-03-04 04:47:12,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-04 04:47:12,718 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-04 04:47:12,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:47:12 BoogieIcfgContainer [2022-03-04 04:47:12,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-04 04:47:12,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-04 04:47:12,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-04 04:47:12,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-04 04:47:12,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:47:11" (1/3) ... [2022-03-04 04:47:12,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b97948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:47:12, skipping insertion in model container [2022-03-04 04:47:12,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:47:12" (2/3) ... [2022-03-04 04:47:12,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b97948a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:47:12, skipping insertion in model container [2022-03-04 04:47:12,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:47:12" (3/3) ... [2022-03-04 04:47:12,727 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-03-04 04:47:12,733 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-04 04:47:12,733 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-04 04:47:12,733 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-03-04 04:47:12,733 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-04 04:47:12,781 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,781 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,781 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,781 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,782 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,782 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,782 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,782 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,787 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,787 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-03-04 04:47:12,787 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-03-04 04:47:12,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,788 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-03-04 04:47:12,788 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-03-04 04:47:12,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,788 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 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-03-04 04:47:12,790 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-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,790 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-03-04 04:47:12,790 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-03-04 04:47:12,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,793 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,799 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,802 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,816 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,817 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,817 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-03-04 04:47:12,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,818 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-03-04 04:47:12,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-04 04:47:12,820 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-04 04:47:12,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-04 04:47:12,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:12,849 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-03-04 04:47:12,850 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-03-04 04:47:12,867 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-04 04:47:12,871 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, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=true [2022-03-04 04:47:12,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-03-04 04:47:12,900 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-04 04:47:12,902 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-03-04 04:47:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 397060765, now seen corresponding path program 1 times [2022-03-04 04:47:12,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:12,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108364543] [2022-03-04 04:47:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:13,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:13,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108364543] [2022-03-04 04:47:13,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108364543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:13,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:13,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-04 04:47:13,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994843823] [2022-03-04 04:47:13,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:13,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-04 04:47:13,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-04 04:47:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-04 04:47:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,067 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:13,068 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-03-04 04:47:13,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,083 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-03-04 04:47:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-04 04:47:13,084 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-03-04 04:47:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1657093153, now seen corresponding path program 1 times [2022-03-04 04:47:13,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:13,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417511250] [2022-03-04 04:47:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:13,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:13,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417511250] [2022-03-04 04:47:13,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417511250] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:13,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:13,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-04 04:47:13,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192930063] [2022-03-04 04:47:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:13,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:47:13,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:47:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-04 04:47:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,171 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:13,171 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-03-04 04:47:13,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,194 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 51 transitions and produced 52 states. [2022-03-04 04:47:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:13,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-04 04:47:13,196 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-03-04 04:47:13,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1891473138, now seen corresponding path program 1 times [2022-03-04 04:47:13,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:13,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450616037] [2022-03-04 04:47:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:13,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:13,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450616037] [2022-03-04 04:47:13,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450616037] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:13,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64195618] [2022-03-04 04:47:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:13,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:13,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:13,264 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-03-04 04:47:13,265 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-03-04 04:47:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-04 04:47:13,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-04 04:47:13,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-04 04:47:13,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64195618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:13,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-04 04:47:13,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-04 04:47:13,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374432565] [2022-03-04 04:47:13,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:13,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-04 04:47:13,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-04 04:47:13,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:47:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,479 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:13,480 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-03-04 04:47:13,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:13,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,504 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 63 transitions and produced 64 states. [2022-03-04 04:47:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:13,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-04 04:47:13,707 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-03-04 04:47:13,708 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-03-04 04:47:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1317859348, now seen corresponding path program 1 times [2022-03-04 04:47:13,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:13,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065033427] [2022-03-04 04:47:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:13,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:13,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065033427] [2022-03-04 04:47:13,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065033427] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:13,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117987211] [2022-03-04 04:47:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:13,769 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-03-04 04:47:13,770 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-03-04 04:47:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:13,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-04 04:47:13,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:13,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:47:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:14,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117987211] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:47:14,032 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:47:14,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-04 04:47:14,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661204867] [2022-03-04 04:47:14,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:47:14,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-04 04:47:14,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:14,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-04 04:47:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-04 04:47:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,034 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:14,034 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-03-04 04:47:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,120 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 77 transitions and produced 78 states. [2022-03-04 04:47:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:14,153 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-03-04 04:47:14,335 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-03-04 04:47:14,336 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-03-04 04:47:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -626594124, now seen corresponding path program 2 times [2022-03-04 04:47:14,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:14,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345494548] [2022-03-04 04:47:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:14,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:14,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345494548] [2022-03-04 04:47:14,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345494548] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:14,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830089440] [2022-03-04 04:47:14,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-04 04:47:14,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:14,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:14,449 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-03-04 04:47:14,450 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-03-04 04:47:14,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-04 04:47:14,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:47:14,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-04 04:47:14,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:14,581 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-03-04 04:47:14,603 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-04 04:47:14,603 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-03-04 04:47:14,632 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-04 04:47:14,633 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-03-04 04:47:14,673 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-04 04:47:14,674 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-03-04 04:47:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-04 04:47:14,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-04 04:47:14,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830089440] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:14,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-04 04:47:14,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-04 04:47:14,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821003295] [2022-03-04 04:47:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:14,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:14,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:14,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:14,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-04 04:47:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,694 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:14,694 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-03-04 04:47:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:14,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,726 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 94 transitions and produced 95 states. [2022-03-04 04:47:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:14,747 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-03-04 04:47:14,943 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-03-04 04:47:14,943 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-03-04 04:47:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1568821428, now seen corresponding path program 1 times [2022-03-04 04:47:14,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:14,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192422520] [2022-03-04 04:47:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:15,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:15,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192422520] [2022-03-04 04:47:15,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192422520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:15,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214114953] [2022-03-04 04:47:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:15,028 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-03-04 04:47:15,029 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-03-04 04:47:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:15,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-04 04:47:15,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:15,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:47:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:15,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214114953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:47:15,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:47:15,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-04 04:47:15,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741082928] [2022-03-04 04:47:15,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:47:15,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-04 04:47:15,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-04 04:47:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-04 04:47:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:15,323 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:15,323 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-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:15,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:15,488 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 122 transitions and produced 115 states. [2022-03-04 04:47:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:15,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-04 04:47:15,695 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-03-04 04:47:15,696 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-03-04 04:47:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1158747276, now seen corresponding path program 2 times [2022-03-04 04:47:15,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:15,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872903612] [2022-03-04 04:47:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-04 04:47:15,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:15,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872903612] [2022-03-04 04:47:15,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872903612] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:15,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159999405] [2022-03-04 04:47:15,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-04 04:47:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:15,854 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-03-04 04:47:15,857 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-03-04 04:47:15,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-04 04:47:15,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:47:15,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-04 04:47:15,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:16,090 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-03-04 04:47:16,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,138 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-03-04 04:47:16,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,170 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-04 04:47:16,170 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-03-04 04:47:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:16,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-04 04:47:16,207 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-03-04 04:47:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-04 04:47:16,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-04 04:47:16,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159999405] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:16,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-04 04:47:16,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-04 04:47:16,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226834466] [2022-03-04 04:47:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:16,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-04 04:47:16,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-04 04:47:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-04 04:47:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:16,233 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:16,233 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-03-04 04:47:16,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:16,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:16,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:16,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:16,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:16,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:16,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:16,417 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 155 transitions and produced 148 states. [2022-03-04 04:47:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:47:16,438 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-03-04 04:47:16,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:16,636 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-03-04 04:47:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1001729759, now seen corresponding path program 1 times [2022-03-04 04:47:16,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:16,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782881083] [2022-03-04 04:47:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-04 04:47:16,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:16,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782881083] [2022-03-04 04:47:16,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782881083] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:16,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64957803] [2022-03-04 04:47:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:16,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:16,728 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-03-04 04:47:16,729 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-03-04 04:47:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:16,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-04 04:47:16,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-04 04:47:17,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:47:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-04 04:47:17,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64957803] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:47:17,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:47:17,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 24 [2022-03-04 04:47:17,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580676724] [2022-03-04 04:47:17,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:47:17,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-04 04:47:17,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-04 04:47:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-04 04:47:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,253 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:17,253 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-03-04 04:47:17,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:17,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:17,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:17,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:47:17,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,559 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 193 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:17,579 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-03-04 04:47:17,761 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-03-04 04:47:17,761 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-03-04 04:47:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2116870732, now seen corresponding path program 1 times [2022-03-04 04:47:17,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:17,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151232853] [2022-03-04 04:47:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-03-04 04:47:17,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:17,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151232853] [2022-03-04 04:47:17,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151232853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:17,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:17,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:47:17,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618217485] [2022-03-04 04:47:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:17,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:17,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:17,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:47:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,860 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:17,860 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-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:17,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,903 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 238 transitions and produced 226 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:17,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-04 04:47:17,905 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-03-04 04:47:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1162619167, now seen corresponding path program 2 times [2022-03-04 04:47:17,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:17,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030642036] [2022-03-04 04:47:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:18,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:18,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030642036] [2022-03-04 04:47:18,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030642036] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:18,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275816140] [2022-03-04 04:47:18,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-04 04:47:18,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:18,019 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-03-04 04:47:18,020 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-03-04 04:47:18,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-04 04:47:18,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:47:18,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-04 04:47:18,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:18,229 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-03-04 04:47:18,249 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-04 04:47:18,250 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-03-04 04:47:18,279 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-04 04:47:18,279 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-03-04 04:47:18,331 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-04 04:47:18,332 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-03-04 04:47:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-03-04 04:47:18,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-04 04:47:18,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275816140] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:18,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-04 04:47:18,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-03-04 04:47:18,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184826301] [2022-03-04 04:47:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:18,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:18,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-04 04:47:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:18,353 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:18,353 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-03-04 04:47:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:18,442 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 255 transitions and produced 243 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:18,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-04 04:47:18,658 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-03-04 04:47:18,659 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-03-04 04:47:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1757402922, now seen corresponding path program 1 times [2022-03-04 04:47:18,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:18,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230963379] [2022-03-04 04:47:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:18,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:18,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230963379] [2022-03-04 04:47:18,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230963379] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:18,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323745707] [2022-03-04 04:47:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:18,726 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-03-04 04:47:18,727 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-03-04 04:47:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:18,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-04 04:47:18,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:19,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:47:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:19,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323745707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:47:19,200 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:47:19,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-04 04:47:19,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40790152] [2022-03-04 04:47:19,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:47:19,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-04 04:47:19,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-04 04:47:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-03-04 04:47:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:19,201 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:19,201 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-03-04 04:47:19,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:19,285 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 441 transitions and produced 429 states. [2022-03-04 04:47:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:19,329 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-03-04 04:47:19,515 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-03-04 04:47:19,516 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-03-04 04:47:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -106070791, now seen corresponding path program 2 times [2022-03-04 04:47:19,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:19,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409875260] [2022-03-04 04:47:19,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:19,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:19,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409875260] [2022-03-04 04:47:19,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409875260] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:19,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679384023] [2022-03-04 04:47:19,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-04 04:47:19,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:19,650 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-03-04 04:47:19,651 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-03-04 04:47:19,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-04 04:47:19,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:47:19,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-04 04:47:19,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:19,981 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-03-04 04:47:20,001 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-04 04:47:20,002 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-03-04 04:47:20,030 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-04 04:47:20,030 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-03-04 04:47:20,067 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-04 04:47:20,068 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-03-04 04:47:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-03-04 04:47:20,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-04 04:47:20,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679384023] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:20,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-04 04:47:20,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-03-04 04:47:20,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135378771] [2022-03-04 04:47:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:20,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:20,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-03-04 04:47:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:20,087 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:20,087 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-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:20,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:20,178 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 476 transitions and produced 464 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:20,202 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-03-04 04:47:20,379 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-03-04 04:47:20,380 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-03-04 04:47:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1731045646, now seen corresponding path program 1 times [2022-03-04 04:47:20,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:20,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292514692] [2022-03-04 04:47:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:20,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:20,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292514692] [2022-03-04 04:47:20,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292514692] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:20,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688352959] [2022-03-04 04:47:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:20,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:20,525 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-03-04 04:47:20,536 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-03-04 04:47:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:20,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-04 04:47:20,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:21,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:47:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-04 04:47:21,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688352959] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:47:21,403 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:47:21,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-03-04 04:47:21,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284605761] [2022-03-04 04:47:21,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:47:21,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-04 04:47:21,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:21,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-04 04:47:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-04 04:47:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:21,406 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:21,406 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-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:21,632 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 786 transitions and produced 774 states. [2022-03-04 04:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:21,652 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-03-04 04:47:21,850 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-03-04 04:47:21,850 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-03-04 04:47:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash -986440607, now seen corresponding path program 2 times [2022-03-04 04:47:21,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:21,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303306553] [2022-03-04 04:47:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:22,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:22,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303306553] [2022-03-04 04:47:22,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303306553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:22,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:22,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:47:22,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612461217] [2022-03-04 04:47:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:22,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:22,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:47:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,071 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:22,071 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-03-04 04:47:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:22,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,191 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 795 transitions and produced 783 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-04 04:47:22,192 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-03-04 04:47:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1833760666, now seen corresponding path program 1 times [2022-03-04 04:47:22,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:22,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592201731] [2022-03-04 04:47:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:22,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:22,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592201731] [2022-03-04 04:47:22,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592201731] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:22,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:22,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-04 04:47:22,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110244903] [2022-03-04 04:47:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:22,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-04 04:47:22,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-04 04:47:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-04 04:47:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,379 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:22,379 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-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,894 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17962 transitions and produced 10076 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:22,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-04 04:47:22,896 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-03-04 04:47:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1924795105, now seen corresponding path program 1 times [2022-03-04 04:47:22,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:22,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945144141] [2022-03-04 04:47:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:23,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:23,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945144141] [2022-03-04 04:47:23,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945144141] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:23,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:23,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-04 04:47:23,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470891306] [2022-03-04 04:47:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:23,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-04 04:47:23,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:23,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-04 04:47:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-04 04:47:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:23,169 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:23,169 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-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:23,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:23,688 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17810 transitions and produced 9999 states. [2022-03-04 04:47:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:23,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-04 04:47:23,690 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-03-04 04:47:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -460892034, now seen corresponding path program 1 times [2022-03-04 04:47:23,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:23,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818630579] [2022-03-04 04:47:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:24,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:24,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818630579] [2022-03-04 04:47:24,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818630579] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:24,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:24,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-04 04:47:24,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924805691] [2022-03-04 04:47:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:24,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-04 04:47:24,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-04 04:47:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-04 04:47:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,036 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:24,036 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-03-04 04:47:24,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,564 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17812 transitions and produced 10004 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-04 04:47:24,566 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-03-04 04:47:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1402749280, now seen corresponding path program 1 times [2022-03-04 04:47:24,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:24,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001948230] [2022-03-04 04:47:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:24,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:24,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001948230] [2022-03-04 04:47:24,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001948230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:24,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:24,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-04 04:47:24,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435495780] [2022-03-04 04:47:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:24,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-04 04:47:24,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-04 04:47:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-04 04:47:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,958 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:24,958 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-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:24,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:25,461 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17821 transitions and produced 10013 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-04 04:47:25,466 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-03-04 04:47:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -535552803, now seen corresponding path program 1 times [2022-03-04 04:47:25,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:25,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714396372] [2022-03-04 04:47:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:25,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:25,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714396372] [2022-03-04 04:47:25,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714396372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-04 04:47:25,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-04 04:47:25,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-04 04:47:25,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664939646] [2022-03-04 04:47:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-04 04:47:25,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-04 04:47:25,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:47:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-04 04:47:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-03-04 04:47:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:25,849 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:47:25,850 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-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:25,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:27,852 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 85540 transitions and produced 46762 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:47:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:47:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:47:27,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-04 04:47:27,854 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-03-04 04:47:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:47:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2082690448, now seen corresponding path program 1 times [2022-03-04 04:47:27,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:47:27,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455743910] [2022-03-04 04:47:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:47:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:28,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:47:28,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455743910] [2022-03-04 04:47:28,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455743910] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:47:28,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609297063] [2022-03-04 04:47:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:47:28,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:47:28,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:47:28,917 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-03-04 04:47:28,918 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-03-04 04:47:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:47:29,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-04 04:47:29,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:47:29,819 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-03-04 04:47:29,849 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-04 04:47:29,849 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-03-04 04:47:29,881 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-04 04:47:29,881 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-03-04 04:47:29,925 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-04 04:47:29,925 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-03-04 04:47:30,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,207 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-03-04 04:47:30,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,244 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-03-04 04:47:30,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,284 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-03-04 04:47:30,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,312 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-03-04 04:47:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,410 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-03-04 04:47:30,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,444 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-03-04 04:47:30,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,470 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-03-04 04:47:30,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:47:30,515 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-03-04 04:47:30,964 INFO L353 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2022-03-04 04:47:30,964 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-03-04 04:47:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:47:30,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:48:06,488 WARN L228 SmtUtils]: Spent 7.68s 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-03-04 04:48:38,322 WARN L228 SmtUtils]: Spent 7.50s 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-03-04 04:48:41,277 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-03-04 04:48:43,435 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-03-04 04:48:45,643 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-03-04 04:48:47,831 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-03-04 04:48:50,885 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-03-04 04:48:53,148 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-03-04 04:48:55,436 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-03-04 04:48:57,727 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-03-04 04:49:01,632 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-03-04 04:49:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 6 not checked. [2022-03-04 04:49:24,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609297063] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:49:24,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:49:24,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 39 [2022-03-04 04:49:24,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759145517] [2022-03-04 04:49:24,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:49:24,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-04 04:49:24,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:49:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-04 04:49:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=649, Unknown=41, NotChecked=594, Total=1560 [2022-03-04 04:49:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:49:24,732 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:49:24,732 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-03-04 04:49:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:49:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:49:24,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:49:27,236 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-03-04 04:49:39,382 WARN L228 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 115 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-04 04:49:41,169 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-03-04 04:49:43,175 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-03-04 04:49:45,493 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-03-04 04:49:47,504 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-03-04 04:50:35,810 WARN L228 SmtUtils]: Spent 18.16s 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-03-04 04:50:37,818 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) (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|) (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 ((.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 (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) .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) (+ 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-03-04 04:50:39,828 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-03-04 04:51:34,089 WARN L228 SmtUtils]: Spent 22.07s 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-03-04 04:51:36,105 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-03-04 04:51:38,115 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-03-04 04:51:39,844 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 100747 transitions and produced 55963 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:51:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:51:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:51:39,879 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-03-04 04:51:40,057 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-03-04 04:51:40,058 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-03-04 04:51:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:51:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -138892593, now seen corresponding path program 2 times [2022-03-04 04:51:40,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:51:40,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590126682] [2022-03-04 04:51:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:51:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:51:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:51:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:51:41,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:51:41,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590126682] [2022-03-04 04:51:41,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590126682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:51:41,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525729240] [2022-03-04 04:51:41,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-04 04:51:41,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:51:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:51:41,436 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-03-04 04:51:41,437 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-03-04 04:51:41,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-04 04:51:41,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:51:41,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-04 04:51:41,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:51:43,216 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-03-04 04:51:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,240 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-03-04 04:51:43,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,280 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-03-04 04:51:43,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,318 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-03-04 04:51:43,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-04 04:51:43,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,779 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-03-04 04:51:43,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,825 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-03-04 04:51:43,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:43,871 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-03-04 04:51:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,041 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-03-04 04:51:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,092 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-03-04 04:51:44,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,139 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-03-04 04:51:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,181 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-03-04 04:51:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,831 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-03-04 04:51:44,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:51:44,871 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-03-04 04:51:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:51:44,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:53:06,299 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-03-04 04:53:08,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-03-04 04:53:10,493 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-03-04 04:53:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:53:23,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525729240] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:53:23,622 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:53:23,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 17] total 36 [2022-03-04 04:53:23,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61647259] [2022-03-04 04:53:23,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:53:23,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-04 04:53:23,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:53:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-04 04:53:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=796, Unknown=39, NotChecked=198, Total=1332 [2022-03-04 04:53:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:23,624 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:53:23,624 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-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:53:23,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:53:28,162 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-03-04 04:53:30,170 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-03-04 04:53:43,378 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-03-04 04:54:17,494 WARN L228 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-04 04:54:39,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 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_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (mod (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| 27)) 28) 0) (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|) (<= (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28) 1) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-04 04:54:41,590 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) (= (mod (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| 27)) 28) 0) (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|) (<= (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* (- 1) |c_~#cache~0.offset|)) 28) 1) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-04 04:54:43,637 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| 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) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-04 04:54:44,424 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 130476 transitions and produced 72193 states. [2022-03-04 04:54:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:54:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:54:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:54:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:54:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:54:44,467 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-03-04 04:54:44,651 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-03-04 04:54:44,651 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-03-04 04:54:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-04 04:54:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash -331735314, now seen corresponding path program 3 times [2022-03-04 04:54:44,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-04 04:54:44,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552728160] [2022-03-04 04:54:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-04 04:54:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-04 04:54:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-04 04:54:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:54:46,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-04 04:54:46,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552728160] [2022-03-04 04:54:46,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552728160] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-04 04:54:46,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613719322] [2022-03-04 04:54:46,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-04 04:54:46,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-04 04:54:46,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-04 04:54:46,417 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-03-04 04:54:46,418 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-03-04 04:54:46,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-04 04:54:46,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-04 04:54:46,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-04 04:54:46,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-04 04:54:48,242 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-03-04 04:54:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,270 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-03-04 04:54:48,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,303 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-03-04 04:54:48,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,341 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-03-04 04:54:48,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,732 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-03-04 04:54:48,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,783 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-03-04 04:54:48,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,819 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-03-04 04:54:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:48,863 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-03-04 04:54:49,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,007 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-03-04 04:54:49,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,053 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-03-04 04:54:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,089 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-03-04 04:54:49,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,125 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-03-04 04:54:49,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,647 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-03-04 04:54:49,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,727 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-03-04 04:54:49,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,775 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-03-04 04:54:49,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-04 04:54:49,825 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-03-04 04:54:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-03-04 04:54:49,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-04 04:55:19,456 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-03-04 04:55:21,743 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-03-04 04:55:25,054 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-03-04 04:55:27,300 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-03-04 04:55:29,566 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-03-04 04:55:31,883 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-03-04 04:55:35,023 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-03-04 04:55:37,264 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-03-04 04:55:39,530 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-03-04 04:55:41,818 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-03-04 04:55:44,976 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-03-04 04:55:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 9 not checked. [2022-03-04 04:55:48,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613719322] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-04 04:55:48,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-04 04:55:48,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 23] total 42 [2022-03-04 04:55:48,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593855393] [2022-03-04 04:55:48,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-04 04:55:48,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-04 04:55:48,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-04 04:55:48,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-04 04:55:48,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=717, Unknown=21, NotChecked=770, Total=1806 [2022-03-04 04:55:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:55:48,683 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-04 04:55:48,684 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-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-04 04:55:48,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-03-04 04:55:48,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:55:48,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-04 04:55:48,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-04 04:56:45,182 WARN L228 SmtUtils]: Spent 55.86s on a formula simplification. DAG size of input: 98 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-04 04:56:47,850 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-03-04 04:56:49,856 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-03-04 04:56:51,861 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-03-04 04:56:53,867 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-03-04 04:57:23,484 WARN L228 SmtUtils]: Spent 29.54s on a formula simplification. DAG size of input: 97 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-04 04:58:00,455 WARN L228 SmtUtils]: Spent 32.86s on a formula simplification. DAG size of input: 143 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-04 04:58:43,065 WARN L228 SmtUtils]: Spent 24.42s 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-03-04 04:58:51,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (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_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) (= (select (let ((.cse5 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (let ((.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ 3 .cse4 |c_~#cache~0.offset|))) (store (let ((.cse2 (+ 2 .cse4 |c_~#cache~0.offset|))) (store (let ((.cse1 (+ .cse4 |c_~#cache~0.offset| 1))) (store (let ((.cse0 (+ .cse4 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse0 v_ArrVal_4882) .cse1 v_ArrVal_4884) .cse2 v_ArrVal_4886) .cse3 v_ArrVal_4889) .cse0 v_ArrVal_4890)) .cse1 v_ArrVal_4892)) .cse2 v_ArrVal_4894)) .cse3 v_ArrVal_4897))) (+ |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)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse6 (+ 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_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 (let ((.cse11 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse10 (+ 3 .cse11 |c_~#cache~0.offset|))) (store (let ((.cse9 (+ 2 .cse11 |c_~#cache~0.offset|))) (store (let ((.cse8 (+ .cse11 |c_~#cache~0.offset| 1))) (store (let ((.cse7 (+ .cse11 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse7 v_ArrVal_4882) .cse8 v_ArrVal_4884) .cse9 v_ArrVal_4886) .cse10 v_ArrVal_4889) .cse7 v_ArrVal_4890)) .cse8 v_ArrVal_4892)) .cse9 v_ArrVal_4894)) .cse10 v_ArrVal_4897))) (+ |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)) (+ 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 .cse6 (+ 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_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_~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse13 (+ |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) .cse13 v_ArrVal_4884) .cse14 v_ArrVal_4886) .cse15 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~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)) (+ 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) (= (select (let ((.cse22 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (let ((.cse21 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse20 (+ 3 .cse21 |c_~#cache~0.offset|))) (store (let ((.cse19 (+ 2 .cse21 |c_~#cache~0.offset|))) (store (let ((.cse18 (+ .cse21 |c_~#cache~0.offset| 1))) (store (let ((.cse17 (+ .cse21 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse17 v_ArrVal_4882) .cse18 v_ArrVal_4884) .cse19 v_ArrVal_4886) .cse20 v_ArrVal_4889) .cse17 v_ArrVal_4890)) .cse18 v_ArrVal_4892)) .cse19 v_ArrVal_4894)) .cse20 v_ArrVal_4897))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse22 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse22 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse22 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse22 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_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 ((.cse26 (* |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 ((.cse25 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse24 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse23 (+ |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) .cse23 v_ArrVal_4884) .cse24 v_ArrVal_4886) .cse25 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse23 v_ArrVal_4892)) .cse24 v_ArrVal_4894)) .cse25 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse26 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse26 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse26 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse26 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.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 (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse30 (* |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 ((.cse29 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse28 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse27 (+ |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) .cse27 v_ArrVal_4884) .cse28 v_ArrVal_4886) .cse29 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse27 v_ArrVal_4892)) .cse28 v_ArrVal_4894)) .cse29 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse30 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse30 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse30 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse30 |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))) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse6 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse6 (+ 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 ((.cse34 (* |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 ((.cse33 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse32 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse31 (+ |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) .cse31 v_ArrVal_4884) .cse32 v_ArrVal_4886) .cse33 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse31 v_ArrVal_4892)) .cse32 v_ArrVal_4894)) .cse33 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse34 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse34 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse34 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse34 |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))) (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) (= (select (let ((.cse40 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (let ((.cse39 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse38 (+ 3 .cse39 |c_~#cache~0.offset|))) (store (let ((.cse37 (+ 2 .cse39 |c_~#cache~0.offset|))) (store (let ((.cse36 (+ .cse39 |c_~#cache~0.offset| 1))) (store (let ((.cse35 (+ .cse39 |c_~#cache~0.offset|))) (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) .cse35 v_ArrVal_4882) .cse36 v_ArrVal_4884) .cse37 v_ArrVal_4886) .cse38 v_ArrVal_4889) .cse35 v_ArrVal_4890)) .cse36 v_ArrVal_4892)) .cse37 v_ArrVal_4894)) .cse38 v_ArrVal_4897))) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse40 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse40 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse40 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse40 |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-03-04 05:00:30,605 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 Received shutdown request... [2022-03-04 05:01:33,471 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-04 05:01:33,471 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-03-04 05:01:33,496 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-03-04 05:01:34,491 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-03-04 05:01:34,510 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-03-04 05:01:34,673 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-03-04 05:01:34,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-04 05:01:34,722 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.MaximalCausalityReduction.internalSuccessors(MaximalCausalityReduction.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.MaximalCausalityReduction.internalSuccessors(MaximalCausalityReduction.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:197) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:127) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:246) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-04 05:01:34,729 INFO L158 Benchmark]: Toolchain (without parser) took 862957.89ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 139.5MB in the beginning and 357.4MB in the end (delta: -217.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-03-04 05:01:34,729 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 191.9MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-04 05:01:34,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.96ms. Allocated memory is still 191.9MB. Free memory was 139.2MB in the beginning and 150.7MB in the end (delta: -11.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-03-04 05:01:34,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.00ms. Allocated memory is still 191.9MB. Free memory was 150.7MB in the beginning and 148.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-04 05:01:34,730 INFO L158 Benchmark]: Boogie Preprocessor took 30.02ms. Allocated memory is still 191.9MB. Free memory was 148.1MB in the beginning and 146.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-04 05:01:34,730 INFO L158 Benchmark]: RCFGBuilder took 402.91ms. Allocated memory is still 191.9MB. Free memory was 146.0MB in the beginning and 129.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-04 05:01:34,730 INFO L158 Benchmark]: TraceAbstraction took 862008.03ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.2MB in the beginning and 357.4MB in the end (delta: -228.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-03-04 05:01:34,731 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-03-04 05:01:34,727 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 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 191.9MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.96ms. Allocated memory is still 191.9MB. Free memory was 139.2MB in the beginning and 150.7MB in the end (delta: -11.5MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.00ms. Allocated memory is still 191.9MB. Free memory was 150.7MB in the beginning and 148.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.02ms. Allocated memory is still 191.9MB. Free memory was 148.1MB in the beginning and 146.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 402.91ms. Allocated memory is still 191.9MB. Free memory was 146.0MB in the beginning and 129.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 862008.03ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.2MB in the beginning and 357.4MB in the end (delta: -228.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown