/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.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_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:13:18,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:13:18,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:13:18,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:13:18,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:13:18,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:13:18,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:13:18,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:13:18,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:13:18,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:13:18,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:13:18,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:13:18,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:13:18,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:13:18,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:13:18,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:13:18,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:13:18,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:13:18,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:13:18,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:13:18,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:13:18,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:13:18,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:13:18,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:13:18,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:13:18,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:13:18,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:13:18,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:13:18,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:13:18,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:13:18,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:13:18,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:13:18,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:13:18,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:13:18,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:13:18,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:13:18,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:13:18,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:13:18,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:13:18,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:13:18,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:13:18,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:13:18,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:13:18,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:13:18,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:13:18,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:13:18,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:13:18,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:13:18,233 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:13:18,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:13:18,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:13:18,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:13:18,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:13:18,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:13:18,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:13:18,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:13:18,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:13:18,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:13:18,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:18,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:13:18,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:13:18,237 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-15 20:13:18,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:13:18,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:13:18,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:13:18,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:13:18,481 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:13:18,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-15 20:13:18,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777c5cd4e/72a3e31762944bb0a4d6e9bfb30103ec/FLAGa100c2580 [2022-03-15 20:13:18,995 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:13:18,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-15 20:13:19,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777c5cd4e/72a3e31762944bb0a4d6e9bfb30103ec/FLAGa100c2580 [2022-03-15 20:13:19,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777c5cd4e/72a3e31762944bb0a4d6e9bfb30103ec [2022-03-15 20:13:19,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:13:19,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:13:19,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:19,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:13:19,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:13:19,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff5cd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19, skipping insertion in model container [2022-03-15 20:13:19,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:13:19,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:13:19,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:19,787 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:13:19,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:19,883 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:13:19,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19 WrapperNode [2022-03-15 20:13:19,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:19,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:19,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:13:19,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:13:19,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,943 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-03-15 20:13:19,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:19,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:13:19,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:13:19,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:13:19,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:19,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:13:19,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:13:19,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:13:19,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:13:19,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (1/1) ... [2022-03-15 20:13:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:20,028 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-15 20:13:20,046 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-15 20:13:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:13:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:13:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:13:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:13:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:13:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:13:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:13:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:13:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:13:20,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:13:20,064 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:13:20,151 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:13:20,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:13:20,332 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:13:20,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:13:20,341 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 20:13:20,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:20 BoogieIcfgContainer [2022-03-15 20:13:20,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:13:20,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:13:20,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:13:20,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:13:20,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:13:19" (1/3) ... [2022-03-15 20:13:20,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6e3fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:20, skipping insertion in model container [2022-03-15 20:13:20,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:19" (2/3) ... [2022-03-15 20:13:20,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6e3fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:20, skipping insertion in model container [2022-03-15 20:13:20,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:20" (3/3) ... [2022-03-15 20:13:20,353 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-03-15 20:13:20,357 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:13:20,357 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:13:20,357 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-15 20:13:20,358 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:13:20,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,397 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,398 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,399 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,400 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,401 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,402 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-15 20:13:20,402 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-15 20:13:20,402 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,402 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-15 20:13:20,402 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-15 20:13:20,403 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-15 20:13:20,403 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-15 20:13:20,403 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-15 20:13:20,403 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-15 20:13:20,403 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-15 20:13:20,404 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-15 20:13:20,404 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-15 20:13:20,404 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-15 20:13:20,404 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-15 20:13:20,404 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-15 20:13:20,404 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-15 20:13:20,405 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-15 20:13:20,405 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-15 20:13:20,405 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-15 20:13:20,405 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-15 20:13:20,405 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-15 20:13:20,406 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-15 20:13:20,406 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-15 20:13:20,406 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-15 20:13:20,406 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-15 20:13:20,406 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-15 20:13:20,406 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-15 20:13:20,407 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-15 20:13:20,407 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-15 20:13:20,407 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-15 20:13:20,407 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-15 20:13:20,408 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-15 20:13:20,408 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-15 20:13:20,408 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-15 20:13:20,408 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-15 20:13:20,408 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-15 20:13:20,408 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-15 20:13:20,409 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-15 20:13:20,409 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-15 20:13:20,409 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-15 20:13:20,409 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-15 20:13:20,409 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-15 20:13:20,409 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-15 20:13:20,410 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-15 20:13:20,410 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-15 20:13:20,410 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-15 20:13:20,410 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-15 20:13:20,411 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-15 20:13:20,411 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-15 20:13:20,411 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-15 20:13:20,411 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-15 20:13:20,411 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-15 20:13:20,411 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-15 20:13:20,412 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-15 20:13:20,412 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-15 20:13:20,412 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-15 20:13:20,412 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-15 20:13:20,413 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-15 20:13:20,413 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-15 20:13:20,413 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-15 20:13:20,413 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-15 20:13:20,414 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-15 20:13:20,414 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-15 20:13:20,414 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-15 20:13:20,414 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-15 20:13:20,415 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-15 20:13:20,415 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-15 20:13:20,415 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-15 20:13:20,415 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-15 20:13:20,415 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-15 20:13:20,415 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-15 20:13:20,416 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-15 20:13:20,416 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-15 20:13:20,416 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-15 20:13:20,416 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-15 20:13:20,416 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-15 20:13:20,416 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,417 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-15 20:13:20,418 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-15 20:13:20,418 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-15 20:13:20,418 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-15 20:13:20,418 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-15 20:13:20,418 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-15 20:13:20,419 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-15 20:13:20,419 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-15 20:13:20,419 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-15 20:13:20,419 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-15 20:13:20,419 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-15 20:13:20,419 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-15 20:13:20,420 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-15 20:13:20,420 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-15 20:13:20,420 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-15 20:13:20,420 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-15 20:13:20,420 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-15 20:13:20,421 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-15 20:13:20,421 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-15 20:13:20,421 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-15 20:13:20,421 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-15 20:13:20,421 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-15 20:13:20,422 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-15 20:13:20,422 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-15 20:13:20,422 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-15 20:13:20,423 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-15 20:13:20,423 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-15 20:13:20,423 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-15 20:13:20,423 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,424 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-15 20:13:20,425 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-15 20:13:20,425 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-15 20:13:20,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,430 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-15 20:13:20,431 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-15 20:13:20,431 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-15 20:13:20,431 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-15 20:13:20,431 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-15 20:13:20,431 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-15 20:13:20,431 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-15 20:13:20,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:20,432 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-15 20:13:20,434 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:13:20,465 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:13:20,471 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:13:20,471 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 20:13:20,480 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:13:20,487 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 106 transitions, 217 flow [2022-03-15 20:13:20,489 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 106 transitions, 217 flow [2022-03-15 20:13:20,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 106 transitions, 217 flow [2022-03-15 20:13:20,534 INFO L129 PetriNetUnfolder]: 6/105 cut-off events. [2022-03-15 20:13:20,534 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:13:20,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 136 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-03-15 20:13:20,546 INFO L116 LiptonReduction]: Number of co-enabled transitions 3192 [2022-03-15 20:13:22,016 INFO L131 LiptonReduction]: Checked pairs total: 8972 [2022-03-15 20:13:22,016 INFO L133 LiptonReduction]: Total number of compositions: 68 [2022-03-15 20:13:22,023 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2022-03-15 20:13:22,056 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 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-15 20:13:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 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-15 20:13:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:13:22,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,065 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1578252910, now seen corresponding path program 1 times [2022-03-15 20:13:22,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:22,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098839732] [2022-03-15 20:13:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,224 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-15 20:13:22,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:22,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098839732] [2022-03-15 20:13:22,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098839732] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:22,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:13:22,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:13:22,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950103652] [2022-03-15 20:13:22,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:22,233 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:22,250 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:13:22,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:22,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:22,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:13:22,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:13:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:13:22,281 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 20:13:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:22,345 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2022-03-15 20:13:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:13:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2022-03-15 20:13:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:22,366 INFO L225 Difference]: With dead ends: 327 [2022-03-15 20:13:22,366 INFO L226 Difference]: Without dead ends: 327 [2022-03-15 20:13:22,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:13:22,371 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:22,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-03-15 20:13:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-03-15 20:13:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 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-15 20:13:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2022-03-15 20:13:22,433 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2022-03-15 20:13:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:22,434 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2022-03-15 20:13:22,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 20:13:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2022-03-15 20:13:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 20:13:22,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:13:22,435 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1431754540, now seen corresponding path program 1 times [2022-03-15 20:13:22,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:22,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636573455] [2022-03-15 20:13:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,488 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-15 20:13:22,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:22,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636573455] [2022-03-15 20:13:22,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636573455] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:22,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580615708] [2022-03-15 20:13:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:22,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:22,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 20:13:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:22,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-15 20:13:22,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:22,661 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-15 20:13:22,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:22,721 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-15 20:13:22,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580615708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:22,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:22,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 20:13:22,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301415180] [2022-03-15 20:13:22,723 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:22,725 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:22,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 20:13:22,726 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:22,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:22,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:13:22,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:13:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:22,728 INFO L87 Difference]: Start difference. First operand 327 states and 651 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 20:13:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:22,775 INFO L93 Difference]: Finished difference Result 328 states and 652 transitions. [2022-03-15 20:13:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 20:13:22,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2022-03-15 20:13:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:22,778 INFO L225 Difference]: With dead ends: 328 [2022-03-15 20:13:22,778 INFO L226 Difference]: Without dead ends: 328 [2022-03-15 20:13:22,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:22,780 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:22,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-15 20:13:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-03-15 20:13:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 320 states have (on average 2.0375) internal successors, (652), 327 states have internal predecessors, (652), 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-15 20:13:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 652 transitions. [2022-03-15 20:13:22,805 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 652 transitions. Word has length 12 [2022-03-15 20:13:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:22,805 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 652 transitions. [2022-03-15 20:13:22,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-15 20:13:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 652 transitions. [2022-03-15 20:13:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:13:22,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:22,806 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:22,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:23,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:23,010 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1185272366, now seen corresponding path program 2 times [2022-03-15 20:13:23,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:23,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046554188] [2022-03-15 20:13:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:23,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:23,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046554188] [2022-03-15 20:13:23,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046554188] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:23,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996705129] [2022-03-15 20:13:23,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:23,120 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-15 20:13:23,147 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-15 20:13:23,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:23,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:23,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:13:23,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:23,280 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-15 20:13:23,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,308 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-15 20:13:23,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,345 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:23,345 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-15 20:13:23,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:23,392 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:23,393 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-15 20:13:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 20:13:23,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:23,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996705129] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:23,418 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:23,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 11 [2022-03-15 20:13:23,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383317287] [2022-03-15 20:13:23,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:23,420 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:23,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:13:23,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:23,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:23,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:23,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:23,424 INFO L87 Difference]: Start difference. First operand 328 states and 652 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-15 20:13:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:23,859 INFO L93 Difference]: Finished difference Result 752 states and 1500 transitions. [2022-03-15 20:13:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) Word has length 13 [2022-03-15 20:13:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:23,866 INFO L225 Difference]: With dead ends: 752 [2022-03-15 20:13:23,866 INFO L226 Difference]: Without dead ends: 752 [2022-03-15 20:13:23,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:13:23,867 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 182 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:23,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 80 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-03-15 20:13:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 454. [2022-03-15 20:13:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 446 states have (on average 2.0269058295964126) internal successors, (904), 453 states have internal predecessors, (904), 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-15 20:13:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 904 transitions. [2022-03-15 20:13:23,883 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 904 transitions. Word has length 13 [2022-03-15 20:13:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:23,884 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 904 transitions. [2022-03-15 20:13:23,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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-15 20:13:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 904 transitions. [2022-03-15 20:13:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:13:23,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:23,885 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:23,910 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-15 20:13:24,100 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-15 20:13:24,101 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1345776311, now seen corresponding path program 1 times [2022-03-15 20:13:24,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:24,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725360998] [2022-03-15 20:13:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:24,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725360998] [2022-03-15 20:13:24,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725360998] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:24,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756573418] [2022-03-15 20:13:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:24,149 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-15 20:13:24,179 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-15 20:13:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 20:13:24,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:24,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756573418] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:24,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:24,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-03-15 20:13:24,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305882769] [2022-03-15 20:13:24,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:24,288 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:24,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:13:24,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:24,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:24,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 20:13:24,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 20:13:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:13:24,291 INFO L87 Difference]: Start difference. First operand 454 states and 904 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 20:13:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:24,318 INFO L93 Difference]: Finished difference Result 455 states and 905 transitions. [2022-03-15 20:13:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 20:13:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-03-15 20:13:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:24,320 INFO L225 Difference]: With dead ends: 455 [2022-03-15 20:13:24,321 INFO L226 Difference]: Without dead ends: 455 [2022-03-15 20:13:24,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:13:24,322 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:24,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-03-15 20:13:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-03-15 20:13:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 447 states have (on average 2.024608501118568) internal successors, (905), 454 states have internal predecessors, (905), 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-15 20:13:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 905 transitions. [2022-03-15 20:13:24,334 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 905 transitions. Word has length 13 [2022-03-15 20:13:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:24,334 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 905 transitions. [2022-03-15 20:13:24,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-15 20:13:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 905 transitions. [2022-03-15 20:13:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:13:24,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:24,335 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:24,360 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-15 20:13:24,551 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-15 20:13:24,552 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 396789113, now seen corresponding path program 2 times [2022-03-15 20:13:24,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:24,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829297991] [2022-03-15 20:13:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 20:13:24,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:24,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829297991] [2022-03-15 20:13:24,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829297991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:24,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:13:24,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:13:24,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1338156712] [2022-03-15 20:13:24,649 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:24,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:24,653 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2022-03-15 20:13:24,653 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:24,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:24,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:24,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:24,654 INFO L87 Difference]: Start difference. First operand 455 states and 905 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-15 20:13:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:24,943 INFO L93 Difference]: Finished difference Result 549 states and 1093 transitions. [2022-03-15 20:13:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 14 [2022-03-15 20:13:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:24,945 INFO L225 Difference]: With dead ends: 549 [2022-03-15 20:13:24,945 INFO L226 Difference]: Without dead ends: 549 [2022-03-15 20:13:24,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:13:24,946 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:24,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-03-15 20:13:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 515. [2022-03-15 20:13:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 507 states have (on average 2.021696252465483) internal successors, (1025), 514 states have internal predecessors, (1025), 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-15 20:13:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1025 transitions. [2022-03-15 20:13:24,957 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1025 transitions. Word has length 14 [2022-03-15 20:13:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:24,957 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 1025 transitions. [2022-03-15 20:13:24,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-15 20:13:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1025 transitions. [2022-03-15 20:13:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:13:24,959 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:24,959 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:24,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:13:24,959 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1272611684, now seen corresponding path program 1 times [2022-03-15 20:13:24,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:24,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847529715] [2022-03-15 20:13:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:25,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847529715] [2022-03-15 20:13:25,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847529715] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:25,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750331528] [2022-03-15 20:13:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:25,020 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-15 20:13:25,028 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-15 20:13:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 20:13:25,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750331528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:25,189 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:25,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 20:13:25,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666874348] [2022-03-15 20:13:25,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:25,192 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:25,196 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 20:13:25,196 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:25,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:25,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:25,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:13:25,197 INFO L87 Difference]: Start difference. First operand 515 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-15 20:13:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:25,229 INFO L93 Difference]: Finished difference Result 516 states and 1026 transitions. [2022-03-15 20:13:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) Word has length 20 [2022-03-15 20:13:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:25,232 INFO L225 Difference]: With dead ends: 516 [2022-03-15 20:13:25,232 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 20:13:25,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-03-15 20:13:25,233 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:25,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 20:13:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-03-15 20:13:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 2.0196850393700787) internal successors, (1026), 515 states have internal predecessors, (1026), 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-15 20:13:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1026 transitions. [2022-03-15 20:13:25,245 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1026 transitions. Word has length 20 [2022-03-15 20:13:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:25,245 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 1026 transitions. [2022-03-15 20:13:25,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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-15 20:13:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1026 transitions. [2022-03-15 20:13:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:13:25,246 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:25,246 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:25,270 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-15 20:13:25,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,467 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1351048294, now seen corresponding path program 2 times [2022-03-15 20:13:25,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:25,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696732267] [2022-03-15 20:13:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:25,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:25,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696732267] [2022-03-15 20:13:25,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696732267] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:25,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994408543] [2022-03-15 20:13:25,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:25,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:25,535 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-15 20:13:25,562 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-15 20:13:25,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:25,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:25,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 20:13:25,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:25,689 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-15 20:13:25,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,710 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-15 20:13:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:25,742 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-15 20:13:25,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:25,777 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:25,777 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-15 20:13:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 20:13:25,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:25,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994408543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:25,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:25,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-03-15 20:13:25,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031945199] [2022-03-15 20:13:25,801 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:25,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:25,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:13:25,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:25,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:25,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:25,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:13:25,810 INFO L87 Difference]: Start difference. First operand 516 states and 1026 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-15 20:13:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:26,167 INFO L93 Difference]: Finished difference Result 871 states and 1736 transitions. [2022-03-15 20:13:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:26,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) Word has length 21 [2022-03-15 20:13:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:26,171 INFO L225 Difference]: With dead ends: 871 [2022-03-15 20:13:26,172 INFO L226 Difference]: Without dead ends: 871 [2022-03-15 20:13:26,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:13:26,172 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:26,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 76 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:13:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-15 20:13:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 686. [2022-03-15 20:13:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 678 states have (on average 2.03834808259587) internal successors, (1382), 685 states have internal predecessors, (1382), 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-15 20:13:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1382 transitions. [2022-03-15 20:13:26,189 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1382 transitions. Word has length 21 [2022-03-15 20:13:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:26,189 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1382 transitions. [2022-03-15 20:13:26,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-15 20:13:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1382 transitions. [2022-03-15 20:13:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:13:26,190 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:26,190 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:26,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:26,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,404 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash -900840723, now seen corresponding path program 1 times [2022-03-15 20:13:26,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:26,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866339932] [2022-03-15 20:13:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:26,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866339932] [2022-03-15 20:13:26,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866339932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:26,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309786087] [2022-03-15 20:13:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:26,452 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-15 20:13:26,475 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-15 20:13:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 20:13:26,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309786087] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:26,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:26,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-03-15 20:13:26,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437198770] [2022-03-15 20:13:26,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:26,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:26,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:13:26,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:26,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:26,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:13:26,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:13:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:26,651 INFO L87 Difference]: Start difference. First operand 686 states and 1382 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-15 20:13:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:26,699 INFO L93 Difference]: Finished difference Result 687 states and 1383 transitions. [2022-03-15 20:13:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:13:26,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 21 [2022-03-15 20:13:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:26,702 INFO L225 Difference]: With dead ends: 687 [2022-03-15 20:13:26,703 INFO L226 Difference]: Without dead ends: 687 [2022-03-15 20:13:26,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:26,703 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:26,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-03-15 20:13:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-03-15 20:13:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 679 states have (on average 2.036818851251841) internal successors, (1383), 686 states have internal predecessors, (1383), 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-15 20:13:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1383 transitions. [2022-03-15 20:13:26,718 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1383 transitions. Word has length 21 [2022-03-15 20:13:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:26,718 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1383 transitions. [2022-03-15 20:13:26,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-15 20:13:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1383 transitions. [2022-03-15 20:13:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 20:13:26,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:26,719 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:26,744 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-15 20:13:26,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,935 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 962591663, now seen corresponding path program 2 times [2022-03-15 20:13:26,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:26,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975296633] [2022-03-15 20:13:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:26,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:26,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:26,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975296633] [2022-03-15 20:13:26,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975296633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:26,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603497336] [2022-03-15 20:13:26,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:26,991 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-15 20:13:27,000 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-15 20:13:27,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:27,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:27,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:27,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:27,109 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-15 20:13:27,133 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:27,134 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-15 20:13:27,163 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:27,164 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-15 20:13:27,249 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:27,250 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-15 20:13:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 20:13:27,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:27,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603497336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:27,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:27,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2022-03-15 20:13:27,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350904833] [2022-03-15 20:13:27,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:27,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:27,278 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2022-03-15 20:13:27,278 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:27,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:27,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:27,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:27,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:27,279 INFO L87 Difference]: Start difference. First operand 687 states and 1383 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-15 20:13:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:27,508 INFO L93 Difference]: Finished difference Result 804 states and 1622 transitions. [2022-03-15 20:13:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 22 [2022-03-15 20:13:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:27,512 INFO L225 Difference]: With dead ends: 804 [2022-03-15 20:13:27,512 INFO L226 Difference]: Without dead ends: 788 [2022-03-15 20:13:27,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:27,512 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:27,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-03-15 20:13:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2022-03-15 20:13:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 751 states have (on average 2.03595206391478) internal successors, (1529), 758 states have internal predecessors, (1529), 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-15 20:13:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1529 transitions. [2022-03-15 20:13:27,528 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1529 transitions. Word has length 22 [2022-03-15 20:13:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:27,529 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1529 transitions. [2022-03-15 20:13:27,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-15 20:13:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1529 transitions. [2022-03-15 20:13:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:13:27,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:27,530 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:27,555 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-15 20:13:27,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:27,753 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash -431407197, now seen corresponding path program 1 times [2022-03-15 20:13:27,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:27,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368622101] [2022-03-15 20:13:27,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:27,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:27,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368622101] [2022-03-15 20:13:27,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368622101] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:27,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172630863] [2022-03-15 20:13:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:27,805 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-15 20:13:27,812 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-15 20:13:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:27,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 20:13:27,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:27,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172630863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:28,013 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:28,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 20:13:28,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392098171] [2022-03-15 20:13:28,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:28,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:28,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 82 transitions. [2022-03-15 20:13:28,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:28,192 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:28,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:13:28,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:13:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:28,193 INFO L87 Difference]: Start difference. First operand 759 states and 1529 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-15 20:13:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:28,233 INFO L93 Difference]: Finished difference Result 760 states and 1530 transitions. [2022-03-15 20:13:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:13:28,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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) Word has length 26 [2022-03-15 20:13:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:28,237 INFO L225 Difference]: With dead ends: 760 [2022-03-15 20:13:28,237 INFO L226 Difference]: Without dead ends: 760 [2022-03-15 20:13:28,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:28,238 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:28,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-03-15 20:13:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-03-15 20:13:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 752 states have (on average 2.0345744680851063) internal successors, (1530), 759 states have internal predecessors, (1530), 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-15 20:13:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1530 transitions. [2022-03-15 20:13:28,253 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1530 transitions. Word has length 26 [2022-03-15 20:13:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:28,253 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1530 transitions. [2022-03-15 20:13:28,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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-15 20:13:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1530 transitions. [2022-03-15 20:13:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:13:28,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:28,254 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:28,284 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-15 20:13:28,478 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-15 20:13:28,478 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2137608159, now seen corresponding path program 2 times [2022-03-15 20:13:28,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:28,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53845866] [2022-03-15 20:13:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:28,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:28,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53845866] [2022-03-15 20:13:28,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53845866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:28,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089306650] [2022-03-15 20:13:28,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:28,541 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-15 20:13:28,541 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-15 20:13:28,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:28,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:28,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 20:13:28,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:28,663 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-15 20:13:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 20:13:28,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:28,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089306650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:28,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:28,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-03-15 20:13:28,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690668951] [2022-03-15 20:13:28,796 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:28,802 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:28,815 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 83 transitions. [2022-03-15 20:13:28,816 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:29,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [18674#(and (or (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0)) (= |~#cache~0.base| 1)) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0)))), 18673#(and (or (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 4)) 0)) (= (* |ULTIMATE.start_main_~i~2#1| 28) 0) (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 1) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 4)) 0)) (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 4)) 0)) (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |~#cache~0.base| 1)))] [2022-03-15 20:13:29,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:13:29,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:13:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:29,181 INFO L87 Difference]: Start difference. First operand 760 states and 1530 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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-15 20:13:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:29,484 INFO L93 Difference]: Finished difference Result 2447 states and 4856 transitions. [2022-03-15 20:13:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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) Word has length 27 [2022-03-15 20:13:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:29,493 INFO L225 Difference]: With dead ends: 2447 [2022-03-15 20:13:29,493 INFO L226 Difference]: Without dead ends: 2447 [2022-03-15 20:13:29,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:13:29,494 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 296 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:29,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 212 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:13:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2022-03-15 20:13:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 776. [2022-03-15 20:13:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 768 states have (on average 2.01953125) internal successors, (1551), 775 states have internal predecessors, (1551), 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-15 20:13:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1551 transitions. [2022-03-15 20:13:29,521 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1551 transitions. Word has length 27 [2022-03-15 20:13:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:29,522 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 1551 transitions. [2022-03-15 20:13:29,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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-15 20:13:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1551 transitions. [2022-03-15 20:13:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:13:29,522 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:29,523 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:29,551 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-15 20:13:29,739 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-15 20:13:29,739 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 271006295, now seen corresponding path program 1 times [2022-03-15 20:13:29,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:29,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087961867] [2022-03-15 20:13:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:29,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:29,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087961867] [2022-03-15 20:13:29,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087961867] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:29,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708036411] [2022-03-15 20:13:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:29,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:29,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:29,809 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-15 20:13:29,810 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-15 20:13:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:29,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 20:13:29,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:29,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:30,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708036411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:30,022 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:30,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2022-03-15 20:13:30,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639159092] [2022-03-15 20:13:30,022 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:30,026 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:30,038 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 83 transitions. [2022-03-15 20:13:30,039 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:30,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:30,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 20:13:30,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 20:13:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:30,158 INFO L87 Difference]: Start difference. First operand 776 states and 1551 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:13:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:30,194 INFO L93 Difference]: Finished difference Result 777 states and 1552 transitions. [2022-03-15 20:13:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:13:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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) Word has length 27 [2022-03-15 20:13:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:30,198 INFO L225 Difference]: With dead ends: 777 [2022-03-15 20:13:30,198 INFO L226 Difference]: Without dead ends: 777 [2022-03-15 20:13:30,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:30,198 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:30,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-03-15 20:13:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2022-03-15 20:13:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 769 states have (on average 2.0182054616384915) internal successors, (1552), 776 states have internal predecessors, (1552), 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-15 20:13:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1552 transitions. [2022-03-15 20:13:30,213 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1552 transitions. Word has length 27 [2022-03-15 20:13:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:30,213 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1552 transitions. [2022-03-15 20:13:30,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-15 20:13:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1552 transitions. [2022-03-15 20:13:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 20:13:30,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:30,214 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:30,243 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-15 20:13:30,435 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-15 20:13:30,436 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1081615975, now seen corresponding path program 2 times [2022-03-15 20:13:30,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:30,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413590870] [2022-03-15 20:13:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:13:30,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:30,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413590870] [2022-03-15 20:13:30,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413590870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:30,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908900466] [2022-03-15 20:13:30,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:30,512 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-15 20:13:30,533 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-15 20:13:30,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:30,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:30,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 20:13:30,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:30,661 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-15 20:13:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 20:13:30,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:30,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908900466] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:30,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:30,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-15 20:13:30,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598747686] [2022-03-15 20:13:30,730 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:30,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:30,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 84 transitions. [2022-03-15 20:13:30,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:30,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [25281#(not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 0)), 25280#(or (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 4)) 0)) (<= 10 |ULTIMATE.start_main_~i~2#1|)), 25283#(and (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |~#cache~0.base| 1)), 25282#(and (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| 4)) 1) (= |~#cache~0.base| 1))] [2022-03-15 20:13:30,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:30,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:13:30,958 INFO L87 Difference]: Start difference. First operand 777 states and 1552 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 20:13:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:31,196 INFO L93 Difference]: Finished difference Result 2367 states and 4695 transitions. [2022-03-15 20:13:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:13:31,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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) Word has length 28 [2022-03-15 20:13:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:31,205 INFO L225 Difference]: With dead ends: 2367 [2022-03-15 20:13:31,205 INFO L226 Difference]: Without dead ends: 2367 [2022-03-15 20:13:31,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:13:31,206 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 335 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:31,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 334 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2022-03-15 20:13:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 819. [2022-03-15 20:13:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 811 states have (on average 1.9987669543773119) internal successors, (1621), 818 states have internal predecessors, (1621), 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-15 20:13:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1621 transitions. [2022-03-15 20:13:31,230 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1621 transitions. Word has length 28 [2022-03-15 20:13:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:31,230 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1621 transitions. [2022-03-15 20:13:31,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 20:13:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1621 transitions. [2022-03-15 20:13:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 20:13:31,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:31,231 INFO L514 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:31,257 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-15 20:13:31,447 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-15 20:13:31,447 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -202175626, now seen corresponding path program 1 times [2022-03-15 20:13:31,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:31,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629747134] [2022-03-15 20:13:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:31,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:31,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629747134] [2022-03-15 20:13:31,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629747134] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:31,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182410914] [2022-03-15 20:13:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:31,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:31,548 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-15 20:13:31,557 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-15 20:13:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:31,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 20:13:31,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:31,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:31,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182410914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:31,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:31,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-03-15 20:13:31,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [941901865] [2022-03-15 20:13:31,810 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:31,815 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:31,821 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 32 transitions. [2022-03-15 20:13:31,822 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:31,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:31,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:31,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:31,823 INFO L87 Difference]: Start difference. First operand 819 states and 1621 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-15 20:13:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:31,861 INFO L93 Difference]: Finished difference Result 820 states and 1622 transitions. [2022-03-15 20:13:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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) Word has length 32 [2022-03-15 20:13:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:31,865 INFO L225 Difference]: With dead ends: 820 [2022-03-15 20:13:31,865 INFO L226 Difference]: Without dead ends: 820 [2022-03-15 20:13:31,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:31,866 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:31,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-03-15 20:13:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2022-03-15 20:13:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 812 states have (on average 1.9975369458128078) internal successors, (1622), 819 states have internal predecessors, (1622), 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-15 20:13:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1622 transitions. [2022-03-15 20:13:31,881 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1622 transitions. Word has length 32 [2022-03-15 20:13:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:31,881 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1622 transitions. [2022-03-15 20:13:31,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-15 20:13:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1622 transitions. [2022-03-15 20:13:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 20:13:31,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:31,882 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:31,905 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-15 20:13:32,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 20:13:32,105 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1547852428, now seen corresponding path program 2 times [2022-03-15 20:13:32,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:32,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018448497] [2022-03-15 20:13:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 20:13:32,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:32,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018448497] [2022-03-15 20:13:32,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018448497] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:32,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401731565] [2022-03-15 20:13:32,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:32,191 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-15 20:13:32,192 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-15 20:13:32,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:32,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:32,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:32,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:32,337 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-15 20:13:32,356 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:32,357 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-15 20:13:32,387 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:32,387 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-15 20:13:32,431 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:32,431 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-15 20:13:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-15 20:13:32,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:32,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401731565] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:32,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:32,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2022-03-15 20:13:32,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691698837] [2022-03-15 20:13:32,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:32,454 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:32,460 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 33 transitions. [2022-03-15 20:13:32,460 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:32,460 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:32,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:32,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:32,461 INFO L87 Difference]: Start difference. First operand 820 states and 1622 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-15 20:13:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:32,666 INFO L93 Difference]: Finished difference Result 952 states and 1886 transitions. [2022-03-15 20:13:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 33 [2022-03-15 20:13:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:32,673 INFO L225 Difference]: With dead ends: 952 [2022-03-15 20:13:32,674 INFO L226 Difference]: Without dead ends: 952 [2022-03-15 20:13:32,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:13:32,676 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:32,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-03-15 20:13:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 876. [2022-03-15 20:13:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 869 states have (on average 1.995397008055236) internal successors, (1734), 875 states have internal predecessors, (1734), 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-15 20:13:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1734 transitions. [2022-03-15 20:13:32,692 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1734 transitions. Word has length 33 [2022-03-15 20:13:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:32,694 INFO L470 AbstractCegarLoop]: Abstraction has 876 states and 1734 transitions. [2022-03-15 20:13:32,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-15 20:13:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1734 transitions. [2022-03-15 20:13:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 20:13:32,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:32,695 INFO L514 BasicCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:32,721 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-15 20:13:32,908 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,SelfDestructingSolverStorable14 [2022-03-15 20:13:32,909 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1187499652, now seen corresponding path program 1 times [2022-03-15 20:13:32,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:32,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021225534] [2022-03-15 20:13:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:32,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:32,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021225534] [2022-03-15 20:13:32,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021225534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:32,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103838212] [2022-03-15 20:13:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:32,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:32,986 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-15 20:13:33,007 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-15 20:13:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:33,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 20:13:33,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103838212] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:33,250 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:33,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 11 [2022-03-15 20:13:33,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889466659] [2022-03-15 20:13:33,251 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:33,258 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:33,298 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 39 transitions. [2022-03-15 20:13:33,299 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:33,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:33,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:13:33,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:13:33,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:33,300 INFO L87 Difference]: Start difference. First operand 876 states and 1734 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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-15 20:13:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:33,351 INFO L93 Difference]: Finished difference Result 877 states and 1735 transitions. [2022-03-15 20:13:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 20:13:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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) Word has length 39 [2022-03-15 20:13:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:33,354 INFO L225 Difference]: With dead ends: 877 [2022-03-15 20:13:33,354 INFO L226 Difference]: Without dead ends: 877 [2022-03-15 20:13:33,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:33,355 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:33,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-03-15 20:13:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2022-03-15 20:13:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 870 states have (on average 1.9942528735632183) internal successors, (1735), 876 states have internal predecessors, (1735), 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-15 20:13:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1735 transitions. [2022-03-15 20:13:33,370 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1735 transitions. Word has length 39 [2022-03-15 20:13:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:33,371 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1735 transitions. [2022-03-15 20:13:33,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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-15 20:13:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1735 transitions. [2022-03-15 20:13:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 20:13:33,371 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:33,372 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:33,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:33,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:33,595 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 929693118, now seen corresponding path program 2 times [2022-03-15 20:13:33,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:33,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88173615] [2022-03-15 20:13:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:33,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:33,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88173615] [2022-03-15 20:13:33,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88173615] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:33,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172935777] [2022-03-15 20:13:33,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:33,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:33,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:33,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 20:13:33,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:33,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:33,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 20:13:33,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:33,862 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-15 20:13:33,882 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 20:13:33,882 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-15 20:13:33,918 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 20:13:33,918 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-15 20:13:33,957 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:13:33,957 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-15 20:13:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-03-15 20:13:33,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 20:13:33,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172935777] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:13:33,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 20:13:33,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 16 [2022-03-15 20:13:33,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1177545095] [2022-03-15 20:13:33,975 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:33,981 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:33,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 40 transitions. [2022-03-15 20:13:33,990 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:33,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:33,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:13:33,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:33,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:13:33,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:13:33,992 INFO L87 Difference]: Start difference. First operand 877 states and 1735 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-15 20:13:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:34,153 INFO L93 Difference]: Finished difference Result 941 states and 1863 transitions. [2022-03-15 20:13:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:13:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 40 [2022-03-15 20:13:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:34,157 INFO L225 Difference]: With dead ends: 941 [2022-03-15 20:13:34,157 INFO L226 Difference]: Without dead ends: 913 [2022-03-15 20:13:34,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:13:34,158 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:34,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:13:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-03-15 20:13:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 616. [2022-03-15 20:13:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 609 states have (on average 1.9556650246305418) internal successors, (1191), 615 states have internal predecessors, (1191), 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-15 20:13:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1191 transitions. [2022-03-15 20:13:34,170 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1191 transitions. Word has length 40 [2022-03-15 20:13:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:34,170 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 1191 transitions. [2022-03-15 20:13:34,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-15 20:13:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1191 transitions. [2022-03-15 20:13:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-15 20:13:34,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:34,171 INFO L514 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:34,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 20:13:34,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 20:13:34,387 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1507155973, now seen corresponding path program 1 times [2022-03-15 20:13:34,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:34,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890164029] [2022-03-15 20:13:34,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:34,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:34,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:34,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890164029] [2022-03-15 20:13:34,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890164029] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:34,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599908834] [2022-03-15 20:13:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:34,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:34,474 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:34,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 20:13:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:34,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 20:13:34,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:34,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 20:13:34,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599908834] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:34,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:34,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2022-03-15 20:13:34,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1322652090] [2022-03-15 20:13:34,777 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:34,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:34,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 128 transitions. [2022-03-15 20:13:34,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:35,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:35,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:13:35,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:35,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:13:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:35,040 INFO L87 Difference]: Start difference. First operand 616 states and 1191 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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-15 20:13:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:35,077 INFO L93 Difference]: Finished difference Result 617 states and 1192 transitions. [2022-03-15 20:13:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 20:13:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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) Word has length 44 [2022-03-15 20:13:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:35,079 INFO L225 Difference]: With dead ends: 617 [2022-03-15 20:13:35,079 INFO L226 Difference]: Without dead ends: 617 [2022-03-15 20:13:35,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:13:35,080 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:35,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:13:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-03-15 20:13:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-03-15 20:13:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 610 states have (on average 1.9540983606557376) internal successors, (1192), 616 states have internal predecessors, (1192), 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-15 20:13:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1192 transitions. [2022-03-15 20:13:35,090 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1192 transitions. Word has length 44 [2022-03-15 20:13:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:35,090 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1192 transitions. [2022-03-15 20:13:35,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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-15 20:13:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1192 transitions. [2022-03-15 20:13:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:35,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:35,091 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:35,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:35,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 20:13:35,308 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1618809597, now seen corresponding path program 2 times [2022-03-15 20:13:35,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:35,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093898094] [2022-03-15 20:13:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:13:35,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:35,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093898094] [2022-03-15 20:13:35,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093898094] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:35,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233677366] [2022-03-15 20:13:35,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:13:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:35,637 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:35,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 20:13:35,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:13:35,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:35,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:13:35,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:35,823 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-15 20:13:35,915 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-15 20:13:35,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:35,956 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-15 20:13:36,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,008 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 30 treesize of output 32 [2022-03-15 20:13:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,066 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 39 treesize of output 44 [2022-03-15 20:13:36,174 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:36,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:36,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:36,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-15 20:13:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:36,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:36,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:36,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:37,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:13:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:37,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233677366] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:37,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:37,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 9] total 28 [2022-03-15 20:13:37,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1596448768] [2022-03-15 20:13:37,179 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:37,187 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:37,217 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:37,217 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:37,367 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:37,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:37,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:13:37,368 INFO L87 Difference]: Start difference. First operand 617 states and 1192 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-15 20:13:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:37,452 INFO L93 Difference]: Finished difference Result 856 states and 1657 transitions. [2022-03-15 20:13:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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) Word has length 45 [2022-03-15 20:13:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:37,456 INFO L225 Difference]: With dead ends: 856 [2022-03-15 20:13:37,456 INFO L226 Difference]: Without dead ends: 856 [2022-03-15 20:13:37,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:13:37,457 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:37,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2022-03-15 20:13:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-03-15 20:13:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 621. [2022-03-15 20:13:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 614 states have (on average 1.9543973941368078) internal successors, (1200), 620 states have internal predecessors, (1200), 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-15 20:13:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1200 transitions. [2022-03-15 20:13:37,468 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1200 transitions. Word has length 45 [2022-03-15 20:13:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:37,468 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 1200 transitions. [2022-03-15 20:13:37,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-15 20:13:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1200 transitions. [2022-03-15 20:13:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:37,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:37,469 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:37,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:37,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:37,692 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1234870293, now seen corresponding path program 3 times [2022-03-15 20:13:37,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:37,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441385956] [2022-03-15 20:13:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:37,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441385956] [2022-03-15 20:13:37,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441385956] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:37,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431104474] [2022-03-15 20:13:37,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:13:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:37,964 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:37,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 20:13:38,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:13:38,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:38,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:13:38,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:38,187 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-15 20:13:38,275 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-15 20:13:38,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,308 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-15 20:13:38,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,356 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 30 treesize of output 32 [2022-03-15 20:13:38,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 20:13:38,547 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:13:38,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:13:38,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:38,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-03-15 20:13:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:38,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:39,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:39,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:13:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:13:39,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431104474] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:39,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:13:39,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2022-03-15 20:13:39,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799601564] [2022-03-15 20:13:39,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:39,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:39,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:39,555 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:39,703 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:13:39,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:13:39,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:13:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:13:39,705 INFO L87 Difference]: Start difference. First operand 621 states and 1200 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-15 20:13:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:39,792 INFO L93 Difference]: Finished difference Result 845 states and 1635 transitions. [2022-03-15 20:13:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 20:13:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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) Word has length 45 [2022-03-15 20:13:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:39,795 INFO L225 Difference]: With dead ends: 845 [2022-03-15 20:13:39,796 INFO L226 Difference]: Without dead ends: 845 [2022-03-15 20:13:39,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:13:39,796 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:39,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 217 Unchecked, 0.1s Time] [2022-03-15 20:13:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-03-15 20:13:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 622. [2022-03-15 20:13:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 615 states have (on average 1.9544715447154473) internal successors, (1202), 621 states have internal predecessors, (1202), 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-15 20:13:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1202 transitions. [2022-03-15 20:13:39,807 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1202 transitions. Word has length 45 [2022-03-15 20:13:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:39,807 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 1202 transitions. [2022-03-15 20:13:39,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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-15 20:13:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1202 transitions. [2022-03-15 20:13:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:39,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:39,808 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:39,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:40,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:40,023 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:40,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1337988693, now seen corresponding path program 4 times [2022-03-15 20:13:40,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:40,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692308469] [2022-03-15 20:13:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:40,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:40,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692308469] [2022-03-15 20:13:40,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692308469] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:40,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396852207] [2022-03-15 20:13:40,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:13:40,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:40,260 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:40,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 20:13:40,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:13:40,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:40,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 20:13:40,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:40,781 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-15 20:13:40,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,810 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-15 20:13:40,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,848 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 30 treesize of output 32 [2022-03-15 20:13:40,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:40,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,004 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 37 treesize of output 42 [2022-03-15 20:13:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:41,062 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 39 treesize of output 44 [2022-03-15 20:13:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:41,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:41,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:41,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:41,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:41,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:41,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396852207] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:41,628 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:41,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:13:41,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502466387] [2022-03-15 20:13:41,628 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:41,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:41,672 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 123 transitions. [2022-03-15 20:13:41,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:43,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:43,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:44,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [47147#(and (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47138#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 47160#(= |t_funThread1of1ForFork0_~i~0#1| 0), 47148#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47145#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 47149#(and (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47158#(and (or (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47139#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 47136#(and (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 47155#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)))), 47150#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 28 (* |ULTIMATE.start_main_~i~2#1| 28))), 47141#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47140#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47152#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 47146#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 47143#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))), 47157#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47159#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 47151#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28))), 47153#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 47137#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)), 47154#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))), 47156#(and (or (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 47144#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)), 47142#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:13:44,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 20:13:44,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 20:13:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2640, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:13:44,057 INFO L87 Difference]: Start difference. First operand 622 states and 1202 transitions. Second operand has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 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-15 20:13:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:47,706 INFO L93 Difference]: Finished difference Result 2098 states and 4044 transitions. [2022-03-15 20:13:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 20:13:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 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) Word has length 45 [2022-03-15 20:13:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:47,714 INFO L225 Difference]: With dead ends: 2098 [2022-03-15 20:13:47,714 INFO L226 Difference]: Without dead ends: 2098 [2022-03-15 20:13:47,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2493 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1119, Invalid=6363, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 20:13:47,717 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 835 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 3948 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:47,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 206 Invalid, 4102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3948 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:13:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-03-15 20:13:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 721. [2022-03-15 20:13:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 714 states have (on average 1.964985994397759) internal successors, (1403), 720 states have internal predecessors, (1403), 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-15 20:13:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1403 transitions. [2022-03-15 20:13:47,735 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1403 transitions. Word has length 45 [2022-03-15 20:13:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:47,735 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 1403 transitions. [2022-03-15 20:13:47,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 37 states have internal predecessors, (100), 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-15 20:13:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1403 transitions. [2022-03-15 20:13:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:47,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:47,736 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:47,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:47,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:47,959 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1337966373, now seen corresponding path program 5 times [2022-03-15 20:13:47,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:47,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137019803] [2022-03-15 20:13:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:13:48,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:48,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137019803] [2022-03-15 20:13:48,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137019803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:48,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161003484] [2022-03-15 20:13:48,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:13:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:48,230 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:48,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 20:13:48,485 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:13:48,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:13:48,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:13:48,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:13:48,741 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-15 20:13:48,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,772 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-15 20:13:48,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,813 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 30 treesize of output 32 [2022-03-15 20:13:48,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:48,956 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 39 treesize of output 44 [2022-03-15 20:13:49,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:13:49,008 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 46 treesize of output 54 [2022-03-15 20:13:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:13:49,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:13:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:49,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161003484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:13:49,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:13:49,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2022-03-15 20:13:49,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [494315204] [2022-03-15 20:13:49,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:13:49,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:13:49,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 129 transitions. [2022-03-15 20:13:49,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:13:51,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:51,795 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:13:51,796 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:13:52,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:13:52,493 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [51078#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))), 51060#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 51082#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))), 51063#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 51086#(and (= (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |~#cache~0.offset|)) (= (select (select |#race| |~#cache~0.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (not (= |~#cache~0.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |~#cache~0.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |~#cache~0.offset|)) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))), 51077#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))), 51076#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))), 51071#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 51084#(<= (* |t_funThread1of1ForFork0_~i~0#1| 28) 0), 51065#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))), 51062#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 51072#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 51081#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))), 51069#(and (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 51075#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28))), 51073#(and (or (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 51061#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 51083#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))), 51080#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))), 51074#(or (<= (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (<= 10 |ULTIMATE.start_main_~i~2#1|)), 51079#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))), 51070#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 51064#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 51067#(and (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))), 51085#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (= (select (select |#race| |~#cache~0.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (= (select (select |#race| |~#cache~0.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 51066#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 51068#(and (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))] [2022-03-15 20:13:52,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 20:13:52,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:13:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 20:13:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 20:13:52,495 INFO L87 Difference]: Start difference. First operand 721 states and 1403 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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-15 20:13:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:13:59,413 INFO L93 Difference]: Finished difference Result 3463 states and 6731 transitions. [2022-03-15 20:13:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 20:13:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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) Word has length 45 [2022-03-15 20:13:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:13:59,423 INFO L225 Difference]: With dead ends: 3463 [2022-03-15 20:13:59,423 INFO L226 Difference]: Without dead ends: 3463 [2022-03-15 20:13:59,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4533 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2461, Invalid=12545, Unknown=0, NotChecked=0, Total=15006 [2022-03-15 20:13:59,427 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 1338 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 4683 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 4683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:13:59,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1338 Valid, 250 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 4683 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 20:13:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-03-15 20:13:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 1447. [2022-03-15 20:13:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1440 states have (on average 2.088888888888889) internal successors, (3008), 1446 states have internal predecessors, (3008), 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-15 20:13:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 3008 transitions. [2022-03-15 20:13:59,478 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 3008 transitions. Word has length 45 [2022-03-15 20:13:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:13:59,479 INFO L470 AbstractCegarLoop]: Abstraction has 1447 states and 3008 transitions. [2022-03-15 20:13:59,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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-15 20:13:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 3008 transitions. [2022-03-15 20:13:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:13:59,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:13:59,480 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:13:59,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 20:13:59,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-15 20:13:59,699 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:13:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:13:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 751274168, now seen corresponding path program 1 times [2022-03-15 20:13:59,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:13:59,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295303759] [2022-03-15 20:13:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:13:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:13:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:13:59,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:13:59,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295303759] [2022-03-15 20:13:59,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295303759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:13:59,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496624930] [2022-03-15 20:13:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:13:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:13:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:59,864 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:13:59,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 20:14:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:00,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:14:00,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:00,333 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-15 20:14:00,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,372 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-15 20:14:00,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,399 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-15 20:14:00,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,436 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 30 treesize of output 32 [2022-03-15 20:14:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:00,477 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 39 treesize of output 44 [2022-03-15 20:14:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:00,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:00,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496624930] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:00,710 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:00,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-03-15 20:14:00,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822114332] [2022-03-15 20:14:00,711 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:00,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:00,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:00,750 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:01,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:14:01,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:14:01,601 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [57867#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 57876#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 57873#(and (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 57866#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 57871#(and (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 57874#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 28 (* |ULTIMATE.start_main_~i~2#1| 28))), 57872#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 57869#(and (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 57870#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 57875#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28))), 57868#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:14:01,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:14:01,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:14:01,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:14:01,603 INFO L87 Difference]: Start difference. First operand 1447 states and 3008 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:14:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:04,548 INFO L93 Difference]: Finished difference Result 3095 states and 6220 transitions. [2022-03-15 20:14:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 20:14:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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) Word has length 45 [2022-03-15 20:14:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:04,554 INFO L225 Difference]: With dead ends: 3095 [2022-03-15 20:14:04,554 INFO L226 Difference]: Without dead ends: 3095 [2022-03-15 20:14:04,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1006, Invalid=6476, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 20:14:04,556 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 630 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:04,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 86 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:14:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-03-15 20:14:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1499. [2022-03-15 20:14:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1492 states have (on average 2.0770777479892764) internal successors, (3099), 1498 states have internal predecessors, (3099), 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-15 20:14:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 3099 transitions. [2022-03-15 20:14:04,588 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 3099 transitions. Word has length 45 [2022-03-15 20:14:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:04,588 INFO L470 AbstractCegarLoop]: Abstraction has 1499 states and 3099 transitions. [2022-03-15 20:14:04,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:14:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 3099 transitions. [2022-03-15 20:14:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:04,589 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:04,589 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:04,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:04,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 20:14:04,790 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:14:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 723568538, now seen corresponding path program 2 times [2022-03-15 20:14:04,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:04,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921985420] [2022-03-15 20:14:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:04,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:04,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921985420] [2022-03-15 20:14:04,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921985420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:04,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402613322] [2022-03-15 20:14:04,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:14:04,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:04,972 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:04,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 20:14:05,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:14:05,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:05,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:14:05,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:05,256 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-15 20:14:05,400 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:05,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:05,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 20:14:05,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 20:14:05,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-03-15 20:14:05,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,567 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 30 treesize of output 32 [2022-03-15 20:14:05,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,601 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 39 treesize of output 44 [2022-03-15 20:14:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:05,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:05,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:05,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:14:05,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:05,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402613322] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:05,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:05,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2022-03-15 20:14:05,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1979451773] [2022-03-15 20:14:05,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:05,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:05,987 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:05,987 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:06,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [64363#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 64356#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 64359#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)))), 64358#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 64361#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)))), 64357#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 64362#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 64360#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))))] [2022-03-15 20:14:06,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:14:06,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:14:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:14:06,946 INFO L87 Difference]: Start difference. First operand 1499 states and 3099 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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-15 20:14:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:08,198 INFO L93 Difference]: Finished difference Result 3628 states and 7540 transitions. [2022-03-15 20:14:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:14:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:14:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:08,204 INFO L225 Difference]: With dead ends: 3628 [2022-03-15 20:14:08,204 INFO L226 Difference]: Without dead ends: 3628 [2022-03-15 20:14:08,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=2145, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 20:14:08,206 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 204 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:08,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 25 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 700 Invalid, 0 Unknown, 236 Unchecked, 0.6s Time] [2022-03-15 20:14:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2022-03-15 20:14:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 1565. [2022-03-15 20:14:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1558 states have (on average 2.0738125802310656) internal successors, (3231), 1564 states have internal predecessors, (3231), 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-15 20:14:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 3231 transitions. [2022-03-15 20:14:08,242 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 3231 transitions. Word has length 45 [2022-03-15 20:14:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 3231 transitions. [2022-03-15 20:14:08,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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-15 20:14:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 3231 transitions. [2022-03-15 20:14:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:08,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:08,248 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:08,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:08,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:08,449 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:14:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash 722703638, now seen corresponding path program 3 times [2022-03-15 20:14:08,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:08,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38313257] [2022-03-15 20:14:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:08,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:08,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:08,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38313257] [2022-03-15 20:14:08,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38313257] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:08,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959087603] [2022-03-15 20:14:08,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:14:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:08,697 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:08,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 20:14:08,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:14:08,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:08,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:14:08,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:08,915 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-15 20:14:09,024 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:14:09,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:14:09,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 20:14:09,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 20:14:09,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:14:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:09,187 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 37 treesize of output 42 [2022-03-15 20:14:12,063 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 20:14:12,063 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-15 20:14:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:14,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:14,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:14,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:14,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:14,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:14:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:14:14,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959087603] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:14,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:14:14,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2022-03-15 20:14:14,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [571370958] [2022-03-15 20:14:14,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:14,721 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:14,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:14,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:16,435 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [71462#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 71463#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)))), 71461#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 71458#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 71460#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)))), 71464#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)))), 71465#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)))), 71459#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (not (= (select (select |#pthreadsMutex| |~#cache~0.base|) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 4)) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))] [2022-03-15 20:14:16,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:14:16,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:16,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:14:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:14:16,437 INFO L87 Difference]: Start difference. First operand 1565 states and 3231 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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-15 20:14:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:18,949 INFO L93 Difference]: Finished difference Result 4037 states and 8405 transitions. [2022-03-15 20:14:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:14:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:14:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:18,957 INFO L225 Difference]: With dead ends: 4037 [2022-03-15 20:14:18,957 INFO L226 Difference]: Without dead ends: 4037 [2022-03-15 20:14:18,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=504, Invalid=2358, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:14:18,958 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 300 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:18,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 26 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 981 Invalid, 0 Unknown, 323 Unchecked, 1.0s Time] [2022-03-15 20:14:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2022-03-15 20:14:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 1583. [2022-03-15 20:14:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1576 states have (on average 2.072969543147208) internal successors, (3267), 1582 states have internal predecessors, (3267), 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-15 20:14:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 3267 transitions. [2022-03-15 20:14:18,997 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 3267 transitions. Word has length 45 [2022-03-15 20:14:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:18,997 INFO L470 AbstractCegarLoop]: Abstraction has 1583 states and 3267 transitions. [2022-03-15 20:14:18,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 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-15 20:14:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 3267 transitions. [2022-03-15 20:14:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:18,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:18,999 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:19,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:19,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:19,214 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:14:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 722676668, now seen corresponding path program 4 times [2022-03-15 20:14:19,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:19,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439648751] [2022-03-15 20:14:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:14:19,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:19,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439648751] [2022-03-15 20:14:19,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439648751] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:19,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356134884] [2022-03-15 20:14:19,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:14:19,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:19,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:19,558 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:19,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 20:14:19,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:14:19,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:14:19,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:14:19,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:20,299 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-15 20:14:20,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,357 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-15 20:14:20,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,412 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 30 treesize of output 32 [2022-03-15 20:14:20,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,497 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 39 treesize of output 44 [2022-03-15 20:14:20,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:20,595 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-15 20:14:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:20,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:21,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:14:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:21,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356134884] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:14:21,534 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:14:21,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2022-03-15 20:14:21,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233299173] [2022-03-15 20:14:21,534 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:14:21,540 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:14:21,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:14:21,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:14:22,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:14:23,041 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [79034#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))), 79032#(or (<= (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) (* |ULTIMATE.start_main_~i~2#1| 28)) (<= 10 |ULTIMATE.start_main_~i~2#1|)), 79031#(and (or (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 79028#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 79026#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 79025#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 79030#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 79027#(and (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 79024#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 79033#(or (<= 9 |ULTIMATE.start_main_~i~2#1|) (<= (* |t_funThread1of1ForFork0_~i~0#1| 28) (* |ULTIMATE.start_main_~i~2#1| 28))), 79029#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (<= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:14:23,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 20:14:23,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:14:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 20:14:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:14:23,043 INFO L87 Difference]: Start difference. First operand 1583 states and 3267 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-15 20:14:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:14:27,131 INFO L93 Difference]: Finished difference Result 3829 states and 7675 transitions. [2022-03-15 20:14:27,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:14:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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) Word has length 45 [2022-03-15 20:14:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:14:27,139 INFO L225 Difference]: With dead ends: 3829 [2022-03-15 20:14:27,139 INFO L226 Difference]: Without dead ends: 3829 [2022-03-15 20:14:27,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=897, Invalid=4803, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 20:14:27,141 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 488 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:14:27,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 168 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:14:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2022-03-15 20:14:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 2409. [2022-03-15 20:14:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2402 states have (on average 2.11240632805995) internal successors, (5074), 2408 states have internal predecessors, (5074), 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-15 20:14:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 5074 transitions. [2022-03-15 20:14:27,183 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 5074 transitions. Word has length 45 [2022-03-15 20:14:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:14:27,183 INFO L470 AbstractCegarLoop]: Abstraction has 2409 states and 5074 transitions. [2022-03-15 20:14:27,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-15 20:14:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 5074 transitions. [2022-03-15 20:14:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:14:27,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:14:27,186 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:14:27,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 20:14:27,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 20:14:27,410 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:14:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:14:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash 918896645, now seen corresponding path program 1 times [2022-03-15 20:14:27,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:14:27,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587173954] [2022-03-15 20:14:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:14:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:27,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:14:27,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587173954] [2022-03-15 20:14:27,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587173954] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:14:27,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028451586] [2022-03-15 20:14:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:14:27,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:14:27,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:14:27,856 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:14:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 20:14:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:14:28,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 20:14:28,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:14:28,192 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-15 20:14:28,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,232 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-15 20:14:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,285 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 30 treesize of output 32 [2022-03-15 20:14:28,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,339 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 39 treesize of output 44 [2022-03-15 20:14:28,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,539 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 46 treesize of output 54 [2022-03-15 20:14:28,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,590 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-15 20:14:28,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,635 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-15 20:14:28,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:14:28,672 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-15 20:14:28,767 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-15 20:14:28,767 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 53 treesize of output 61 [2022-03-15 20:14:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:14:28,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:14:31,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (and (forall ((v_ArrVal_2766 Int) (v_ArrVal_2767 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) v_ArrVal_2766) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_2767)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_2766 Int) (v_ArrVal_2767 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) v_ArrVal_2766) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_2767)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_2766 Int) (v_ArrVal_2767 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) v_ArrVal_2766) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_2767)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) 0)) (forall ((v_ArrVal_2766 Int) (v_ArrVal_2767 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) v_ArrVal_2766) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_2767)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) is different from false [2022-03-15 20:14:59,811 WARN L228 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:15:14,961 WARN L228 SmtUtils]: Spent 9.45s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:15:33,834 WARN L228 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 20:15:33,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:33,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:33,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:34,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:15:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:42,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028451586] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:42,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:42,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-03-15 20:15:42,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483449428] [2022-03-15 20:15:42,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:42,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:42,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 107 transitions. [2022-03-15 20:15:42,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:44,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:45,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:45,759 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [88047#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 88053#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 88050#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 88051#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 88052#(and (<= (+ |~#cache~0.offset| 28) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)), 88055#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28))), 88046#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 88054#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 28 (* |ULTIMATE.start_main_~i~2#1| 28))), 88056#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 88048#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 88049#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))] [2022-03-15 20:15:45,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:15:45,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:15:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1454, Unknown=16, NotChecked=80, Total=1806 [2022-03-15 20:15:45,760 INFO L87 Difference]: Start difference. First operand 2409 states and 5074 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:15:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:15:52,221 INFO L93 Difference]: Finished difference Result 4072 states and 8385 transitions. [2022-03-15 20:15:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:15:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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) Word has length 45 [2022-03-15 20:15:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:15:52,230 INFO L225 Difference]: With dead ends: 4072 [2022-03-15 20:15:52,230 INFO L226 Difference]: Without dead ends: 4068 [2022-03-15 20:15:52,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 76.1s TimeCoverageRelationStatistics Valid=709, Invalid=3569, Unknown=16, NotChecked=128, Total=4422 [2022-03-15 20:15:52,231 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 423 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:15:52,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 234 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2738 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-03-15 20:15:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2022-03-15 20:15:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2505. [2022-03-15 20:15:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2498 states have (on average 2.1080864691753405) internal successors, (5266), 2504 states have internal predecessors, (5266), 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-15 20:15:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 5266 transitions. [2022-03-15 20:15:52,273 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 5266 transitions. Word has length 45 [2022-03-15 20:15:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:15:52,273 INFO L470 AbstractCegarLoop]: Abstraction has 2505 states and 5266 transitions. [2022-03-15 20:15:52,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:15:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 5266 transitions. [2022-03-15 20:15:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:15:52,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:15:52,276 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:15:52,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 20:15:52,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 20:15:52,491 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:15:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:15:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -578504925, now seen corresponding path program 1 times [2022-03-15 20:15:52,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:15:52,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531439662] [2022-03-15 20:15:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:15:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:52,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:15:52,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531439662] [2022-03-15 20:15:52,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531439662] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:15:52,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813532844] [2022-03-15 20:15:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:15:52,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:15:52,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:15:52,831 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:15:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 20:15:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:15:53,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:15:53,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:15:53,631 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-15 20:15:53,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,717 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-15 20:15:53,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,790 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-15 20:15:53,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,885 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 30 treesize of output 32 [2022-03-15 20:15:53,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:15:53,997 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 39 treesize of output 44 [2022-03-15 20:15:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:54,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:15:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:15:54,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813532844] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:15:54,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:15:54,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-03-15 20:15:54,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549241186] [2022-03-15 20:15:54,558 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:15:54,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:15:54,594 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:15:54,594 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:15:54,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:54,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:15:55,225 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [97480#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28))), 97481#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 97479#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 28 (* |ULTIMATE.start_main_~i~2#1| 28)))] [2022-03-15 20:15:55,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:15:55,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:15:55,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:15:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:15:55,226 INFO L87 Difference]: Start difference. First operand 2505 states and 5266 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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-15 20:16:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:00,129 INFO L93 Difference]: Finished difference Result 3988 states and 8218 transitions. [2022-03-15 20:16:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 20:16:00,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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) Word has length 45 [2022-03-15 20:16:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:00,136 INFO L225 Difference]: With dead ends: 3988 [2022-03-15 20:16:00,136 INFO L226 Difference]: Without dead ends: 3988 [2022-03-15 20:16:00,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=649, Invalid=3511, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 20:16:00,137 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 456 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:00,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 144 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-15 20:16:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2022-03-15 20:16:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 2522. [2022-03-15 20:16:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2515 states have (on average 2.107355864811133) internal successors, (5300), 2521 states have internal predecessors, (5300), 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-15 20:16:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 5300 transitions. [2022-03-15 20:16:00,181 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 5300 transitions. Word has length 45 [2022-03-15 20:16:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:00,181 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 5300 transitions. [2022-03-15 20:16:00,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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-15 20:16:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 5300 transitions. [2022-03-15 20:16:00,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:00,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:00,184 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:00,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:00,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 20:16:00,403 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:00,404 INFO L85 PathProgramCache]: Analyzing trace with hash -517731285, now seen corresponding path program 2 times [2022-03-15 20:16:00,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:00,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729168201] [2022-03-15 20:16:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-03-15 20:16:00,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:00,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729168201] [2022-03-15 20:16:00,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729168201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:00,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316466169] [2022-03-15 20:16:00,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:16:00,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:00,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:00,769 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:00,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 20:16:00,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 20:16:00,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:00,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:16:00,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:01,175 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-15 20:16:01,361 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:16:01,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:16:01,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 20:16:01,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 20:16:01,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,732 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 28 treesize of output 30 [2022-03-15 20:16:01,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,828 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 30 treesize of output 32 [2022-03-15 20:16:01,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:01,908 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 39 treesize of output 44 [2022-03-15 20:16:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:16:01,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:16:02,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:02,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:16:02,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:16:02,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316466169] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:02,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:16:02,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 9] total 26 [2022-03-15 20:16:02,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017822775] [2022-03-15 20:16:02,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:02,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:02,681 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:16:02,681 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:03,031 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:03,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:16:03,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:16:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:16:03,032 INFO L87 Difference]: Start difference. First operand 2522 states and 5300 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-15 20:16:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:04,970 INFO L93 Difference]: Finished difference Result 5237 states and 11107 transitions. [2022-03-15 20:16:04,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:16:04,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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) Word has length 45 [2022-03-15 20:16:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:04,977 INFO L225 Difference]: With dead ends: 5237 [2022-03-15 20:16:04,977 INFO L226 Difference]: Without dead ends: 5237 [2022-03-15 20:16:04,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:16:04,977 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:04,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 25 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 543 Invalid, 0 Unknown, 237 Unchecked, 0.9s Time] [2022-03-15 20:16:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2022-03-15 20:16:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 2579. [2022-03-15 20:16:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2572 states have (on average 2.1049766718506997) internal successors, (5414), 2578 states have internal predecessors, (5414), 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-15 20:16:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 5414 transitions. [2022-03-15 20:16:05,025 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 5414 transitions. Word has length 45 [2022-03-15 20:16:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:05,025 INFO L470 AbstractCegarLoop]: Abstraction has 2579 states and 5414 transitions. [2022-03-15 20:16:05,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-15 20:16:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 5414 transitions. [2022-03-15 20:16:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:05,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:05,028 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:05,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:05,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 20:16:05,250 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -515742015, now seen corresponding path program 3 times [2022-03-15 20:16:05,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:05,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010452131] [2022-03-15 20:16:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:05,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:05,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010452131] [2022-03-15 20:16:05,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010452131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:05,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561798932] [2022-03-15 20:16:05,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:16:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:05,779 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:05,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 20:16:06,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 20:16:06,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:06,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:16:06,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:06,262 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-15 20:16:06,500 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 20:16:06,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 20:16:06,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 20:16:06,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:06,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 20:16:06,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:06,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:06,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 20:16:07,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,033 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 37 treesize of output 42 [2022-03-15 20:16:07,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:07,143 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 39 treesize of output 44 [2022-03-15 20:16:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:16:07,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:16:07,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:07,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:07,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:07,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:08,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-03-15 20:16:08,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-03-15 20:16:08,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561798932] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:08,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 20:16:08,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2022-03-15 20:16:08,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499371114] [2022-03-15 20:16:08,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:08,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:08,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:16:08,237 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:08,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:08,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 20:16:08,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 20:16:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:16:08,688 INFO L87 Difference]: Start difference. First operand 2579 states and 5414 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-15 20:16:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:10,952 INFO L93 Difference]: Finished difference Result 5228 states and 11089 transitions. [2022-03-15 20:16:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:16:10,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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) Word has length 45 [2022-03-15 20:16:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:10,959 INFO L225 Difference]: With dead ends: 5228 [2022-03-15 20:16:10,959 INFO L226 Difference]: Without dead ends: 5228 [2022-03-15 20:16:10,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:16:10,959 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 117 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:10,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 26 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 477 Invalid, 0 Unknown, 360 Unchecked, 0.8s Time] [2022-03-15 20:16:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2022-03-15 20:16:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 2590. [2022-03-15 20:16:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2583 states have (on average 2.1045296167247387) internal successors, (5436), 2589 states have internal predecessors, (5436), 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-15 20:16:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 5436 transitions. [2022-03-15 20:16:11,006 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 5436 transitions. Word has length 45 [2022-03-15 20:16:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:11,006 INFO L470 AbstractCegarLoop]: Abstraction has 2590 states and 5436 transitions. [2022-03-15 20:16:11,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 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-15 20:16:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 5436 transitions. [2022-03-15 20:16:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:11,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:11,008 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:11,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:11,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:11,223 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -515676915, now seen corresponding path program 4 times [2022-03-15 20:16:11,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:11,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069936739] [2022-03-15 20:16:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:11,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:11,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069936739] [2022-03-15 20:16:11,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069936739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:11,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759016160] [2022-03-15 20:16:11,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:16:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:11,848 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:11,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 20:16:12,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:16:12,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:12,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 20:16:12,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:12,752 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-15 20:16:12,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:12,824 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-15 20:16:12,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:12,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:12,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:12,917 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 30 treesize of output 32 [2022-03-15 20:16:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,025 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 39 treesize of output 44 [2022-03-15 20:16:13,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:13,145 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-15 20:16:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:13,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:16:14,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:14,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759016160] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:16:14,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:16:14,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:16:14,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371398751] [2022-03-15 20:16:14,824 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:14,829 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:14,851 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 93 transitions. [2022-03-15 20:16:14,851 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:15,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:15,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:15,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [128317#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 28 (* |ULTIMATE.start_main_~i~2#1| 28))), 128318#(and (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28))), 128319#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 (* |ULTIMATE.start_main_~i~2#1| 28)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (<= 9 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))] [2022-03-15 20:16:15,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:16:15,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:15,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:16:15,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:16:15,588 INFO L87 Difference]: Start difference. First operand 2590 states and 5436 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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-15 20:16:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:18,933 INFO L93 Difference]: Finished difference Result 4063 states and 8368 transitions. [2022-03-15 20:16:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:16:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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) Word has length 45 [2022-03-15 20:16:18,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:18,938 INFO L225 Difference]: With dead ends: 4063 [2022-03-15 20:16:18,938 INFO L226 Difference]: Without dead ends: 4063 [2022-03-15 20:16:18,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:16:18,939 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 277 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:18,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 276 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:16:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2022-03-15 20:16:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 2597. [2022-03-15 20:16:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2590 states have (on average 2.1042471042471043) internal successors, (5450), 2596 states have internal predecessors, (5450), 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-15 20:16:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 5450 transitions. [2022-03-15 20:16:18,974 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 5450 transitions. Word has length 45 [2022-03-15 20:16:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:18,975 INFO L470 AbstractCegarLoop]: Abstraction has 2597 states and 5450 transitions. [2022-03-15 20:16:18,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 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-15 20:16:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 5450 transitions. [2022-03-15 20:16:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:18,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:18,977 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:19,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:19,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:19,191 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash 789804857, now seen corresponding path program 5 times [2022-03-15 20:16:19,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:19,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167378348] [2022-03-15 20:16:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:19,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:19,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167378348] [2022-03-15 20:16:19,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167378348] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:19,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686395915] [2022-03-15 20:16:19,787 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:16:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:19,789 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:19,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 20:16:20,388 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:16:20,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:20,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:16:20,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:20,979 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-15 20:16:21,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,054 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-15 20:16:21,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,133 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 30 treesize of output 32 [2022-03-15 20:16:21,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,234 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 39 treesize of output 44 [2022-03-15 20:16:21,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:21,383 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-15 20:16:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:21,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:16:22,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:22,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686395915] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:16:22,683 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:16:22,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:16:22,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44931613] [2022-03-15 20:16:22,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:22,688 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:22,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 105 transitions. [2022-03-15 20:16:22,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:23,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:23,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:23,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:23,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:23,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:23,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:24,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:24,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:24,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:26,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [137912#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 137909#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (= (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 137914#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 137906#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 137910#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 137904#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 137913#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 137908#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (= (select (select |#race| |~#cache~0.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 137911#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= (select (select |#race| |~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|)))) (or (not (= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 137905#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 137907#(and (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))] [2022-03-15 20:16:26,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:16:26,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:26,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:16:26,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:16:26,124 INFO L87 Difference]: Start difference. First operand 2597 states and 5450 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:16:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:35,777 INFO L93 Difference]: Finished difference Result 4103 states and 8377 transitions. [2022-03-15 20:16:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:16:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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) Word has length 45 [2022-03-15 20:16:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:35,782 INFO L225 Difference]: With dead ends: 4103 [2022-03-15 20:16:35,782 INFO L226 Difference]: Without dead ends: 4103 [2022-03-15 20:16:35,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=990, Invalid=5016, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 20:16:35,783 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 463 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:35,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 259 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-03-15 20:16:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-03-15 20:16:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2838. [2022-03-15 20:16:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2838 states, 2831 states have (on average 2.110561638996821) internal successors, (5975), 2837 states have internal predecessors, (5975), 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-15 20:16:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 5975 transitions. [2022-03-15 20:16:35,815 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 5975 transitions. Word has length 45 [2022-03-15 20:16:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:35,815 INFO L470 AbstractCegarLoop]: Abstraction has 2838 states and 5975 transitions. [2022-03-15 20:16:35,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 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-15 20:16:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 5975 transitions. [2022-03-15 20:16:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:35,817 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:35,817 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:35,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:36,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 20:16:36,042 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1965473333, now seen corresponding path program 2 times [2022-03-15 20:16:36,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:36,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142598983] [2022-03-15 20:16:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:36,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:36,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142598983] [2022-03-15 20:16:36,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142598983] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:36,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280104877] [2022-03-15 20:16:36,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:16:36,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:36,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:36,505 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:36,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 20:16:36,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:16:36,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:36,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 20:16:36,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:37,418 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-15 20:16:37,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,495 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-15 20:16:37,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,587 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 30 treesize of output 32 [2022-03-15 20:16:37,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,696 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 39 treesize of output 44 [2022-03-15 20:16:37,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:37,815 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 46 treesize of output 54 [2022-03-15 20:16:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:37,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:16:38,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:38,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:16:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:39,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280104877] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:16:39,117 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:16:39,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:16:39,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849567001] [2022-03-15 20:16:39,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:39,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:39,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 89 transitions. [2022-03-15 20:16:39,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:39,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:39,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:39,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:39,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:39,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:16:41,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [148062#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 148064#(and (or (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 3))) (<= 10 |ULTIMATE.start_main_~i~2#1|)) (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset| 2)))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |ULTIMATE.start_main_~i~2#1| 28) |~#cache~0.offset|))) (<= 10 |ULTIMATE.start_main_~i~2#1|))), 148065#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 148066#(and (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 148063#(and (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))), 148067#(and (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= (select (select |#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))), 148061#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0))] [2022-03-15 20:16:41,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:16:41,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:41,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:16:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:16:41,023 INFO L87 Difference]: Start difference. First operand 2838 states and 5975 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 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-15 20:16:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:46,512 INFO L93 Difference]: Finished difference Result 4138 states and 8483 transitions. [2022-03-15 20:16:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:16:46,512 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 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) Word has length 45 [2022-03-15 20:16:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:46,518 INFO L225 Difference]: With dead ends: 4138 [2022-03-15 20:16:46,518 INFO L226 Difference]: Without dead ends: 4138 [2022-03-15 20:16:46,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=653, Invalid=3253, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 20:16:46,519 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 382 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:46,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 204 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 20:16:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2022-03-15 20:16:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2840. [2022-03-15 20:16:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2833 states have (on average 2.1101306036004237) internal successors, (5978), 2839 states have internal predecessors, (5978), 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-15 20:16:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5978 transitions. [2022-03-15 20:16:46,553 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5978 transitions. Word has length 45 [2022-03-15 20:16:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:46,553 INFO L470 AbstractCegarLoop]: Abstraction has 2840 states and 5978 transitions. [2022-03-15 20:16:46,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 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-15 20:16:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5978 transitions. [2022-03-15 20:16:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:16:46,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:46,555 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:46,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 20:16:46,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:46,772 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:16:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash -779206588, now seen corresponding path program 5 times [2022-03-15 20:16:46,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:46,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552587967] [2022-03-15 20:16:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:47,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:47,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552587967] [2022-03-15 20:16:47,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552587967] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:16:47,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627245452] [2022-03-15 20:16:47,584 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 20:16:47,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:16:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:16:47,585 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:16:47,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 20:16:48,608 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 20:16:48,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:16:48,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 20:16:48,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:16:49,059 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-15 20:16:49,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,148 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-15 20:16:49,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,245 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 30 treesize of output 32 [2022-03-15 20:16:49,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,335 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 39 treesize of output 44 [2022-03-15 20:16:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,597 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 46 treesize of output 54 [2022-03-15 20:16:49,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,644 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-15 20:16:49,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 20:16:49,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,759 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-15 20:16:49,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:16:49,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-03-15 20:16:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:16:58,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:17:01,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= 0 (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) 0))))) is different from false [2022-03-15 20:17:03,326 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (let ((.cse0 (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) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (let ((.cse1 (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) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= 0 (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (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|) .cse3 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (let ((.cse4 (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) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0))))) is different from false [2022-03-15 20:17:05,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (and (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= 0 (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (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|) .cse1 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (let ((.cse2 (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) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (select (select (let ((.cse3 (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) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_3843 Int) (v_ArrVal_3840 Int)) (= (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (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) 0) .cse5 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) v_ArrVal_3840) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_112| v_ArrVal_3843))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5)) 0))))) is different from false [2022-03-15 20:17:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-03-15 20:17:12,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627245452] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:17:12,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:17:12,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2022-03-15 20:17:12,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666254981] [2022-03-15 20:17:12,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:12,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:12,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 95 transitions. [2022-03-15 20:17:12,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:14,833 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [158239#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 158238#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 158237#(and (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 158234#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 158236#(and (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))), 158235#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))] [2022-03-15 20:17:14,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:17:14,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:17:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1122, Unknown=9, NotChecked=216, Total=1560 [2022-03-15 20:17:14,834 INFO L87 Difference]: Start difference. First operand 2840 states and 5978 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 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-15 20:17:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:19,279 INFO L93 Difference]: Finished difference Result 4165 states and 8571 transitions. [2022-03-15 20:17:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:17:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 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) Word has length 45 [2022-03-15 20:17:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:19,285 INFO L225 Difference]: With dead ends: 4165 [2022-03-15 20:17:19,285 INFO L226 Difference]: Without dead ends: 4161 [2022-03-15 20:17:19,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=458, Invalid=2301, Unknown=9, NotChecked=312, Total=3080 [2022-03-15 20:17:19,286 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 300 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:19,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 247 Invalid, 2359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:17:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2022-03-15 20:17:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 2861. [2022-03-15 20:17:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2854 states have (on average 2.108969866853539) internal successors, (6019), 2860 states have internal predecessors, (6019), 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-15 20:17:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 6019 transitions. [2022-03-15 20:17:19,318 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 6019 transitions. Word has length 45 [2022-03-15 20:17:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:19,318 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 6019 transitions. [2022-03-15 20:17:19,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 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-15 20:17:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 6019 transitions. [2022-03-15 20:17:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:17:19,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:19,320 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:19,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 20:17:19,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:19,526 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:17:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1616722741, now seen corresponding path program 6 times [2022-03-15 20:17:19,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:19,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348728825] [2022-03-15 20:17:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:19,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:19,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348728825] [2022-03-15 20:17:19,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348728825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:17:19,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046538700] [2022-03-15 20:17:19,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 20:17:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:17:19,904 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:17:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 20:17:20,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 20:17:20,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:17:20,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:17:20,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:17:20,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:20,864 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-15 20:17:20,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:20,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:20,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:20,950 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 28 treesize of output 30 [2022-03-15 20:17:21,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,036 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 37 treesize of output 42 [2022-03-15 20:17:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2022-03-15 20:17:21,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:21,252 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 46 treesize of output 54 [2022-03-15 20:17:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:21,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:17:21,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2022-03-15 20:17:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:21,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046538700] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:17:21,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:17:21,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2022-03-15 20:17:21,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033260236] [2022-03-15 20:17:21,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:21,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:21,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 89 transitions. [2022-03-15 20:17:21,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:23,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:23,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:23,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [168458#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 168463#(= |t_funThread1of1ForFork0_~i~0#1| 0), 168459#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 168453#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 168456#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 168461#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 168460#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 168457#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 168454#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 168455#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))), 168462#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 |ULTIMATE.start_main_~i~2#1|))] [2022-03-15 20:17:23,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:17:23,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:17:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:17:23,654 INFO L87 Difference]: Start difference. First operand 2861 states and 6019 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:30,719 INFO L93 Difference]: Finished difference Result 4804 states and 9900 transitions. [2022-03-15 20:17:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 20:17:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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) Word has length 45 [2022-03-15 20:17:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:30,725 INFO L225 Difference]: With dead ends: 4804 [2022-03-15 20:17:30,725 INFO L226 Difference]: Without dead ends: 4804 [2022-03-15 20:17:30,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1127, Invalid=6355, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 20:17:30,726 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 560 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:30,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 239 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-03-15 20:17:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2022-03-15 20:17:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 3162. [2022-03-15 20:17:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 3155 states have (on average 2.1099841521394613) internal successors, (6657), 3161 states have internal predecessors, (6657), 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-15 20:17:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 6657 transitions. [2022-03-15 20:17:30,764 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 6657 transitions. Word has length 45 [2022-03-15 20:17:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:30,764 INFO L470 AbstractCegarLoop]: Abstraction has 3162 states and 6657 transitions. [2022-03-15 20:17:30,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 6657 transitions. [2022-03-15 20:17:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:17:30,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:30,766 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:30,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 20:17:30,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 20:17:30,991 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:17:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1714139311, now seen corresponding path program 7 times [2022-03-15 20:17:30,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:30,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097054944] [2022-03-15 20:17:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:31,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:31,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097054944] [2022-03-15 20:17:31,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097054944] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:17:31,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361308573] [2022-03-15 20:17:31,370 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 20:17:31,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:17:31,372 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:17:31,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 20:17:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:31,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:17:31,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:17:32,237 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-15 20:17:32,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,328 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-15 20:17:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,412 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 28 treesize of output 30 [2022-03-15 20:17:32,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,480 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 30 treesize of output 32 [2022-03-15 20:17:32,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:32,565 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 39 treesize of output 44 [2022-03-15 20:17:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:32,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:17:32,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:33,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361308573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:17:33,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:17:33,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 20:17:33,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180587823] [2022-03-15 20:17:33,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:33,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:33,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 89 transitions. [2022-03-15 20:17:33,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:34,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:34,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:35,059 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [179981#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 179983#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 179978#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 179986#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 |ULTIMATE.start_main_~i~2#1|)), 179980#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 179987#(= |t_funThread1of1ForFork0_~i~0#1| 0), 179977#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 179979#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))), 179984#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 179985#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 179982#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))] [2022-03-15 20:17:35,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:17:35,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:35,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:17:35,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 20:17:35,060 INFO L87 Difference]: Start difference. First operand 3162 states and 6657 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:39,886 INFO L93 Difference]: Finished difference Result 4792 states and 9876 transitions. [2022-03-15 20:17:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 20:17:39,887 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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) Word has length 45 [2022-03-15 20:17:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:39,892 INFO L225 Difference]: With dead ends: 4792 [2022-03-15 20:17:39,892 INFO L226 Difference]: Without dead ends: 4792 [2022-03-15 20:17:39,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=617, Invalid=3543, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 20:17:39,893 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 559 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:39,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 284 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:17:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2022-03-15 20:17:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 3159. [2022-03-15 20:17:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 3152 states have (on average 2.1100888324873095) internal successors, (6651), 3158 states have internal predecessors, (6651), 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-15 20:17:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 6651 transitions. [2022-03-15 20:17:39,936 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 6651 transitions. Word has length 45 [2022-03-15 20:17:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:39,936 INFO L470 AbstractCegarLoop]: Abstraction has 3159 states and 6651 transitions. [2022-03-15 20:17:39,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 6651 transitions. [2022-03-15 20:17:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:17:39,938 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:39,938 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:39,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 20:17:40,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 20:17:40,149 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:17:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1715494321, now seen corresponding path program 8 times [2022-03-15 20:17:40,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:40,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679782521] [2022-03-15 20:17:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:40,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:40,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679782521] [2022-03-15 20:17:40,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679782521] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:17:40,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918565386] [2022-03-15 20:17:40,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:17:40,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:17:40,560 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:17:40,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 20:17:40,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:17:40,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:17:40,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 20:17:40,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:17:41,425 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-15 20:17:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,507 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-15 20:17:41,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,600 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 30 treesize of output 32 [2022-03-15 20:17:41,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,708 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 37 treesize of output 42 [2022-03-15 20:17:41,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:41,793 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 39 treesize of output 44 [2022-03-15 20:17:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:41,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:17:42,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:42,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:42,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:42,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:42,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918565386] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:17:42,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:17:42,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:17:42,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644338827] [2022-03-15 20:17:42,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:42,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:42,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 89 transitions. [2022-03-15 20:17:42,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:44,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:44,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:44,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [191442#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 191450#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 191447#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 191451#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 |ULTIMATE.start_main_~i~2#1|)), 191448#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 191452#(= |t_funThread1of1ForFork0_~i~0#1| 0), 191449#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 191443#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 191444#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))), 191445#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 191446#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (= |t_funThread1of1ForFork0_~i~0#1| 0)))] [2022-03-15 20:17:44,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:17:44,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:17:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:17:44,613 INFO L87 Difference]: Start difference. First operand 3159 states and 6651 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:49,174 INFO L93 Difference]: Finished difference Result 4774 states and 9839 transitions. [2022-03-15 20:17:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:17:49,174 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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) Word has length 45 [2022-03-15 20:17:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:49,179 INFO L225 Difference]: With dead ends: 4774 [2022-03-15 20:17:49,179 INFO L226 Difference]: Without dead ends: 4774 [2022-03-15 20:17:49,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=622, Invalid=3538, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 20:17:49,180 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 382 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:49,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 347 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 20:17:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2022-03-15 20:17:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 3156. [2022-03-15 20:17:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3156 states, 3149 states have (on average 2.109876151159098) internal successors, (6644), 3155 states have internal predecessors, (6644), 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-15 20:17:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 6644 transitions. [2022-03-15 20:17:49,215 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 6644 transitions. Word has length 45 [2022-03-15 20:17:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:49,215 INFO L470 AbstractCegarLoop]: Abstraction has 3156 states and 6644 transitions. [2022-03-15 20:17:49,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 6644 transitions. [2022-03-15 20:17:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:17:49,217 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:49,217 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:49,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 20:17:49,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 20:17:49,417 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:17:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1715516641, now seen corresponding path program 9 times [2022-03-15 20:17:49,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:49,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158077633] [2022-03-15 20:17:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:49,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:49,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158077633] [2022-03-15 20:17:49,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158077633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:17:49,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169943582] [2022-03-15 20:17:49,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:17:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:17:49,919 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:17:49,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 20:17:50,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:17:50,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:17:50,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 20:17:50,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:17:50,640 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-15 20:17:50,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,716 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-15 20:17:50,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,792 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 30 treesize of output 32 [2022-03-15 20:17:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:17:50,895 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 39 treesize of output 44 [2022-03-15 20:17:51,042 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-15 20:17:51,042 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 53 treesize of output 61 [2022-03-15 20:17:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:51,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:17:51,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:51,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:17:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:17:52,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169943582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:17:52,493 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:17:52,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:17:52,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810352440] [2022-03-15 20:17:52,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:52,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:52,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 89 transitions. [2022-03-15 20:17:52,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:53,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:54,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:17:54,414 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [202888#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 202892#(= |t_funThread1of1ForFork0_~i~0#1| 0), 202884#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))))), 202886#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|)) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 202883#(and (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (or (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))))), 202882#(and (<= 0 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)), 202889#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 202890#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (or (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))), 202891#(and (or (<= 10 |ULTIMATE.start_main_~i~2#1|) (= |t_funThread1of1ForFork0_~i~0#1| 0)) (<= 0 |ULTIMATE.start_main_~i~2#1|)), 202885#(and (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (not (= |ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (= |t_funThread1of1ForFork0_~i~0#1| 0))), 202887#(and (or (<= 0 |ULTIMATE.start_main_~i~2#1|) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))) (or (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (= |t_funThread1of1ForFork0_~i~0#1| 0) (not (= (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= 0 (select (select |#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))] [2022-03-15 20:17:54,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:17:54,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:17:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:17:54,415 INFO L87 Difference]: Start difference. First operand 3156 states and 6644 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:59,326 INFO L93 Difference]: Finished difference Result 4759 states and 9807 transitions. [2022-03-15 20:17:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 20:17:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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) Word has length 45 [2022-03-15 20:17:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:59,332 INFO L225 Difference]: With dead ends: 4759 [2022-03-15 20:17:59,332 INFO L226 Difference]: Without dead ends: 4759 [2022-03-15 20:17:59,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=621, Invalid=3539, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 20:17:59,333 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 533 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:59,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 302 Invalid, 2429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 20:17:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2022-03-15 20:17:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 3081. [2022-03-15 20:17:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3074 states have (on average 2.1096291476903057) internal successors, (6485), 3080 states have internal predecessors, (6485), 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-15 20:17:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 6485 transitions. [2022-03-15 20:17:59,385 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 6485 transitions. Word has length 45 [2022-03-15 20:17:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:59,385 INFO L470 AbstractCegarLoop]: Abstraction has 3081 states and 6485 transitions. [2022-03-15 20:17:59,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 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-15 20:17:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 6485 transitions. [2022-03-15 20:17:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:17:59,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:59,387 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:59,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 20:17:59,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:17:59,599 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:17:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1170313188, now seen corresponding path program 1 times [2022-03-15 20:17:59,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:59,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722233353] [2022-03-15 20:17:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:00,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:00,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722233353] [2022-03-15 20:18:00,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722233353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:00,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30315054] [2022-03-15 20:18:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:00,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:00,127 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:00,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 20:18:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:00,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 20:18:00,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:00,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 11 treesize of output 7 [2022-03-15 20:18:01,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,066 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-15 20:18:01,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,152 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 30 treesize of output 32 [2022-03-15 20:18:01,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,250 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 39 treesize of output 44 [2022-03-15 20:18:01,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:01,403 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 46 treesize of output 54 [2022-03-15 20:18:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:01,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:02,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:02,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30315054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:02,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:02,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:18:02,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797549745] [2022-03-15 20:18:02,873 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:02,880 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:02,906 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 83 transitions. [2022-03-15 20:18:02,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:03,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [214157#(= |t_funThread1of1ForFork0_~i~0#1| 0), 214156#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:18:03,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:18:03,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:18:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:18:03,396 INFO L87 Difference]: Start difference. First operand 3081 states and 6485 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 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-15 20:18:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:06,270 INFO L93 Difference]: Finished difference Result 4606 states and 9540 transitions. [2022-03-15 20:18:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:18:06,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 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) Word has length 45 [2022-03-15 20:18:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:06,275 INFO L225 Difference]: With dead ends: 4606 [2022-03-15 20:18:06,275 INFO L226 Difference]: Without dead ends: 4606 [2022-03-15 20:18:06,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=440, Invalid=2212, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 20:18:06,276 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 323 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:06,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 220 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:18:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2022-03-15 20:18:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3411. [2022-03-15 20:18:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 3404 states have (on average 2.1095769682726204) internal successors, (7181), 3410 states have internal predecessors, (7181), 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-15 20:18:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 7181 transitions. [2022-03-15 20:18:06,317 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 7181 transitions. Word has length 45 [2022-03-15 20:18:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:06,317 INFO L470 AbstractCegarLoop]: Abstraction has 3411 states and 7181 transitions. [2022-03-15 20:18:06,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 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-15 20:18:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 7181 transitions. [2022-03-15 20:18:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:06,318 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:06,318 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:06,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-15 20:18:06,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 20:18:06,531 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1948985632, now seen corresponding path program 1 times [2022-03-15 20:18:06,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:06,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832441376] [2022-03-15 20:18:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:07,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:07,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832441376] [2022-03-15 20:18:07,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832441376] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:07,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287610749] [2022-03-15 20:18:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:07,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:07,076 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:07,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 20:18:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:07,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:18:07,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:07,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 20:18:08,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,046 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-15 20:18:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,132 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 30 treesize of output 32 [2022-03-15 20:18:08,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,249 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 39 treesize of output 44 [2022-03-15 20:18:08,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:08,362 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-15 20:18:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:08,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:09,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:09,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287610749] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:09,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:09,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:18:09,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243764433] [2022-03-15 20:18:09,763 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:09,769 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:09,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 75 transitions. [2022-03-15 20:18:09,793 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:10,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [225919#(= |t_funThread1of1ForFork0_~i~0#1| 0), 225918#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:18:10,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:18:10,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:18:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:18:10,059 INFO L87 Difference]: Start difference. First operand 3411 states and 7181 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 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-15 20:18:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:12,811 INFO L93 Difference]: Finished difference Result 4679 states and 9686 transitions. [2022-03-15 20:18:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:18:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 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) Word has length 45 [2022-03-15 20:18:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:12,816 INFO L225 Difference]: With dead ends: 4679 [2022-03-15 20:18:12,816 INFO L226 Difference]: Without dead ends: 4679 [2022-03-15 20:18:12,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 20:18:12,817 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 307 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:12,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 250 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:18:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2022-03-15 20:18:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3472. [2022-03-15 20:18:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3465 states have (on average 2.1085137085137085) internal successors, (7306), 3471 states have internal predecessors, (7306), 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-15 20:18:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 7306 transitions. [2022-03-15 20:18:12,869 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 7306 transitions. Word has length 45 [2022-03-15 20:18:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:12,869 INFO L470 AbstractCegarLoop]: Abstraction has 3472 states and 7306 transitions. [2022-03-15 20:18:12,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 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-15 20:18:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 7306 transitions. [2022-03-15 20:18:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:12,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:12,871 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:12,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 20:18:13,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 20:18:13,087 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -409201361, now seen corresponding path program 1 times [2022-03-15 20:18:13,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:13,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807250100] [2022-03-15 20:18:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:14,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:14,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807250100] [2022-03-15 20:18:14,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807250100] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:14,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490169400] [2022-03-15 20:18:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:14,028 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 20:18:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:14,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 20:18:14,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:14,795 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-15 20:18:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:14,866 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-15 20:18:14,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:14,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:14,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:14,956 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 30 treesize of output 32 [2022-03-15 20:18:15,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,067 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 39 treesize of output 44 [2022-03-15 20:18:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,210 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 46 treesize of output 54 [2022-03-15 20:18:15,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,264 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-15 20:18:15,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,323 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-15 20:18:15,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,372 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-15 20:18:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:15,499 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 46 treesize of output 54 [2022-03-15 20:18:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:15,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:17,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:17,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490169400] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:17,937 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:17,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-03-15 20:18:17,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [274322085] [2022-03-15 20:18:17,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:17,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:17,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 87 transitions. [2022-03-15 20:18:17,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:18,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:18,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [237866#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 237867#(= |t_funThread1of1ForFork0_~i~0#1| 0), 237868#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 3 (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| 2 (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28) 1)))))] [2022-03-15 20:18:18,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:18:18,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:18:18,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:18:18,863 INFO L87 Difference]: Start difference. First operand 3472 states and 7306 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:18:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:22,328 INFO L93 Difference]: Finished difference Result 4695 states and 9718 transitions. [2022-03-15 20:18:22,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:18:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-03-15 20:18:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:22,333 INFO L225 Difference]: With dead ends: 4695 [2022-03-15 20:18:22,333 INFO L226 Difference]: Without dead ends: 4691 [2022-03-15 20:18:22,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=485, Invalid=2485, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 20:18:22,334 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 409 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:22,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 202 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:18:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-03-15 20:18:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 3577. [2022-03-15 20:18:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3570 states have (on average 2.1103641456582634) internal successors, (7534), 3576 states have internal predecessors, (7534), 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-15 20:18:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 7534 transitions. [2022-03-15 20:18:22,373 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 7534 transitions. Word has length 45 [2022-03-15 20:18:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:22,373 INFO L470 AbstractCegarLoop]: Abstraction has 3577 states and 7534 transitions. [2022-03-15 20:18:22,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:18:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 7534 transitions. [2022-03-15 20:18:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:22,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:22,374 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:22,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 20:18:22,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:22,575 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1866504954, now seen corresponding path program 1 times [2022-03-15 20:18:22,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:22,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915818304] [2022-03-15 20:18:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:22,851 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:22,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915818304] [2022-03-15 20:18:22,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915818304] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:22,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578542504] [2022-03-15 20:18:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:22,852 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:22,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 20:18:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:23,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 20:18:23,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:23,736 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-15 20:18:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,810 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-15 20:18:23,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,865 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-15 20:18:23,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,928 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 30 treesize of output 32 [2022-03-15 20:18:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:24,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:24,001 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 39 treesize of output 44 [2022-03-15 20:18:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:24,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:24,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578542504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:24,529 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:24,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 20:18:24,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549887883] [2022-03-15 20:18:24,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:24,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:24,556 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:18:24,556 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:24,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:24,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:24,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:24,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:25,329 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [250049#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|))), 250051#(= |t_funThread1of1ForFork0_~i~0#1| 0), 250050#(<= 1 |t_funThread1of1ForFork0_~i~0#1|)] [2022-03-15 20:18:25,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:18:25,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:18:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:18:25,330 INFO L87 Difference]: Start difference. First operand 3577 states and 7534 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:28,971 INFO L93 Difference]: Finished difference Result 4420 states and 9163 transitions. [2022-03-15 20:18:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 20:18:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:18:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:28,977 INFO L225 Difference]: With dead ends: 4420 [2022-03-15 20:18:28,977 INFO L226 Difference]: Without dead ends: 4420 [2022-03-15 20:18:28,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=557, Invalid=3103, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 20:18:28,978 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 452 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:28,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 228 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:18:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2022-03-15 20:18:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3579. [2022-03-15 20:18:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3572 states have (on average 2.1103023516237402) internal successors, (7538), 3578 states have internal predecessors, (7538), 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-15 20:18:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 7538 transitions. [2022-03-15 20:18:29,014 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 7538 transitions. Word has length 45 [2022-03-15 20:18:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:29,014 INFO L470 AbstractCegarLoop]: Abstraction has 3579 states and 7538 transitions. [2022-03-15 20:18:29,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 7538 transitions. [2022-03-15 20:18:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:29,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:29,015 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:29,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 20:18:29,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 20:18:29,216 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1769088384, now seen corresponding path program 2 times [2022-03-15 20:18:29,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:29,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107917795] [2022-03-15 20:18:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:29,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:29,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107917795] [2022-03-15 20:18:29,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107917795] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:29,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195164026] [2022-03-15 20:18:29,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:18:29,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:29,540 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:29,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 20:18:29,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:18:29,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:18:29,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 20:18:29,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:30,456 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-15 20:18:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,528 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-15 20:18:30,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,619 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-15 20:18:30,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,682 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 30 treesize of output 32 [2022-03-15 20:18:30,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:30,768 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 39 treesize of output 44 [2022-03-15 20:18:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:30,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:31,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:31,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195164026] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:31,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:31,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 20:18:31,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229152207] [2022-03-15 20:18:31,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:31,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:31,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:18:31,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:31,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:31,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:31,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:31,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:31,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:31,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:32,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [261983#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 261982#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 261984#(= |t_funThread1of1ForFork0_~i~0#1| 0)] [2022-03-15 20:18:32,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:18:32,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:18:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:18:32,506 INFO L87 Difference]: Start difference. First operand 3579 states and 7538 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:35,133 INFO L93 Difference]: Finished difference Result 4396 states and 9115 transitions. [2022-03-15 20:18:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:18:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:18:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:35,139 INFO L225 Difference]: With dead ends: 4396 [2022-03-15 20:18:35,139 INFO L226 Difference]: Without dead ends: 4396 [2022-03-15 20:18:35,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:18:35,139 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 310 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:35,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 253 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 20:18:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2022-03-15 20:18:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 3645. [2022-03-15 20:18:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3638 states have (on average 2.112974161627268) internal successors, (7687), 3644 states have internal predecessors, (7687), 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-15 20:18:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 7687 transitions. [2022-03-15 20:18:35,184 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 7687 transitions. Word has length 45 [2022-03-15 20:18:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:35,184 INFO L470 AbstractCegarLoop]: Abstraction has 3645 states and 7687 transitions. [2022-03-15 20:18:35,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 7687 transitions. [2022-03-15 20:18:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:35,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:35,187 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:35,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 20:18:35,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:35,399 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:35,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1767733374, now seen corresponding path program 3 times [2022-03-15 20:18:35,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:35,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057887664] [2022-03-15 20:18:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:35,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:35,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057887664] [2022-03-15 20:18:35,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057887664] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:35,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719755642] [2022-03-15 20:18:35,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 20:18:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:35,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:35,815 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:35,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 20:18:36,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 20:18:36,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:18:36,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 20:18:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:36,731 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-15 20:18:36,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,811 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-15 20:18:36,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,888 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 30 treesize of output 32 [2022-03-15 20:18:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:36,992 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-15 20:18:37,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:37,074 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 39 treesize of output 44 [2022-03-15 20:18:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:37,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:37,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:37,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:37,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:37,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:38,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719755642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:38,153 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:38,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 20:18:38,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129702240] [2022-03-15 20:18:38,153 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:38,157 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:38,180 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:18:38,180 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:38,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:38,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:38,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:38,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:39,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:39,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:39,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:39,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:39,410 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [273985#(= |t_funThread1of1ForFork0_~i~0#1| 0), 273984#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 273986#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))))] [2022-03-15 20:18:39,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:18:39,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:18:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:18:39,411 INFO L87 Difference]: Start difference. First operand 3645 states and 7687 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:42,148 INFO L93 Difference]: Finished difference Result 4390 states and 9102 transitions. [2022-03-15 20:18:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:18:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:18:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:42,153 INFO L225 Difference]: With dead ends: 4390 [2022-03-15 20:18:42,153 INFO L226 Difference]: Without dead ends: 4390 [2022-03-15 20:18:42,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 20:18:42,153 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 267 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:42,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 336 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 20:18:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2022-03-15 20:18:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 3653. [2022-03-15 20:18:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3646 states have (on average 2.1130005485463523) internal successors, (7704), 3652 states have internal predecessors, (7704), 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-15 20:18:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 7704 transitions. [2022-03-15 20:18:42,187 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 7704 transitions. Word has length 45 [2022-03-15 20:18:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:42,187 INFO L470 AbstractCegarLoop]: Abstraction has 3653 states and 7704 transitions. [2022-03-15 20:18:42,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 7704 transitions. [2022-03-15 20:18:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:42,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:42,189 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:42,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 20:18:42,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:42,391 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1767711054, now seen corresponding path program 4 times [2022-03-15 20:18:42,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:42,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184056086] [2022-03-15 20:18:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:42,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:42,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184056086] [2022-03-15 20:18:42,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184056086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:42,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183547640] [2022-03-15 20:18:42,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 20:18:42,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:42,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:42,920 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:42,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 20:18:43,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 20:18:43,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:18:43,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 20:18:43,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:43,922 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-15 20:18:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,000 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-15 20:18:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,088 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 30 treesize of output 32 [2022-03-15 20:18:44,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,188 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 39 treesize of output 44 [2022-03-15 20:18:44,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:44,304 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-15 20:18:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:44,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:18:45,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 20:18:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:45,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183547640] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 20:18:45,759 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 20:18:45,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 20:18:45,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573045047] [2022-03-15 20:18:45,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:18:45,763 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:18:45,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 99 transitions. [2022-03-15 20:18:45,786 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:18:45,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:45,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:45,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:46,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2022-03-15 20:18:47,019 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [285998#(<= 1 |t_funThread1of1ForFork0_~i~0#1|), 285997#(and (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)) (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (or (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))) (<= 10 |t_funThread1of1ForFork0_~i~0#1|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= |ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28))))) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (= |ULTIMATE.start_cache_entry_addref_~entry#1.base| |~#cache~0.base|)) (or (<= 10 |t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) (+ |~#cache~0.offset| (* |t_funThread1of1ForFork0_~i~0#1| 28)))))), 285999#(= |t_funThread1of1ForFork0_~i~0#1| 0)] [2022-03-15 20:18:47,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:18:47,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:18:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:18:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:18:47,019 INFO L87 Difference]: Start difference. First operand 3653 states and 7704 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:18:49,418 INFO L93 Difference]: Finished difference Result 4385 states and 9092 transitions. [2022-03-15 20:18:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 20:18:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) Word has length 45 [2022-03-15 20:18:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:18:49,423 INFO L225 Difference]: With dead ends: 4385 [2022-03-15 20:18:49,423 INFO L226 Difference]: Without dead ends: 4385 [2022-03-15 20:18:49,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=335, Invalid=1557, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 20:18:49,424 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 375 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:18:49,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 245 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 20:18:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2022-03-15 20:18:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 3662. [2022-03-15 20:18:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3655 states have (on average 2.1129958960328317) internal successors, (7723), 3661 states have internal predecessors, (7723), 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-15 20:18:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 7723 transitions. [2022-03-15 20:18:49,478 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 7723 transitions. Word has length 45 [2022-03-15 20:18:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:18:49,478 INFO L470 AbstractCegarLoop]: Abstraction has 3662 states and 7723 transitions. [2022-03-15 20:18:49,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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-15 20:18:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 7723 transitions. [2022-03-15 20:18:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 20:18:49,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:18:49,480 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:18:49,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 20:18:49,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 20:18:49,695 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 20:18:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:18:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1621059296, now seen corresponding path program 2 times [2022-03-15 20:18:49,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:18:49,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832209602] [2022-03-15 20:18:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:18:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:18:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:18:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:50,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:18:50,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832209602] [2022-03-15 20:18:50,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832209602] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 20:18:50,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578592797] [2022-03-15 20:18:50,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 20:18:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 20:18:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:18:50,482 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 20:18:50,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 20:18:50,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 20:18:50,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 20:18:50,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 20:18:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 20:18:51,264 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-15 20:18:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,427 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 19 treesize of output 18 [2022-03-15 20:18:51,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,447 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-15 20:18:51,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,476 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-15 20:18:51,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,503 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-15 20:18:51,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,568 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-15 20:18:51,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,672 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 30 treesize of output 32 [2022-03-15 20:18:51,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,768 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 39 treesize of output 44 [2022-03-15 20:18:51,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 20:18:51,885 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-15 20:18:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-03-15 20:18:51,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 20:19:02,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| Int)) (or (and (forall ((v_ArrVal_5675 Int) (v_ArrVal_5674 Int) (v_ArrVal_5684 Int) (v_ArrVal_5672 Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| 1) v_ArrVal_5672) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5674) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5675)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| v_ArrVal_5684))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5675 Int) (v_ArrVal_5674 Int) (v_ArrVal_5684 Int) (v_ArrVal_5672 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| 1) v_ArrVal_5672) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5674) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5675)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| v_ArrVal_5684))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((v_ArrVal_5675 Int) (v_ArrVal_5674 Int) (v_ArrVal_5684 Int) (v_ArrVal_5672 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| 1) v_ArrVal_5672) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5674) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5675)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| v_ArrVal_5684))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_5675 Int) (v_ArrVal_5674 Int) (v_ArrVal_5684 Int) (v_ArrVal_5672 Int)) (= (let ((.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| 1) v_ArrVal_5672) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5674) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234|) v_ArrVal_5675)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (select .cse8 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| v_ArrVal_5684))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_234| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2022-03-15 20:19:29,854 WARN L228 SmtUtils]: Spent 27.46s on a formula simplification. DAG size of input: 515 DAG size of output: 512 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 20:19:29,856 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 20:19:29,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 20:19:30,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 20:19:30,067 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) 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-15 20:19:30,070 INFO L158 Benchmark]: Toolchain (without parser) took 370737.84ms. Allocated memory was 198.2MB in the beginning and 741.3MB in the end (delta: 543.2MB). Free memory was 145.8MB in the beginning and 245.9MB in the end (delta: -100.1MB). Peak memory consumption was 553.5MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,070 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:19:30,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.43ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 155.1MB in the end (delta: -9.6MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.49ms. Allocated memory is still 198.2MB. Free memory was 155.1MB in the beginning and 152.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,070 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 198.2MB. Free memory was 152.5MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,070 INFO L158 Benchmark]: RCFGBuilder took 349.36ms. Allocated memory is still 198.2MB. Free memory was 150.9MB in the beginning and 136.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,071 INFO L158 Benchmark]: TraceAbstraction took 369725.16ms. Allocated memory was 198.2MB in the beginning and 741.3MB in the end (delta: 543.2MB). Free memory was 135.7MB in the beginning and 245.9MB in the end (delta: -110.2MB). Peak memory consumption was 543.2MB. Max. memory is 8.0GB. [2022-03-15 20:19:30,071 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 551.43ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 155.1MB in the end (delta: -9.6MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.49ms. Allocated memory is still 198.2MB. Free memory was 155.1MB in the beginning and 152.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.62ms. Allocated memory is still 198.2MB. Free memory was 152.5MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.36ms. Allocated memory is still 198.2MB. Free memory was 150.9MB in the beginning and 136.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 369725.16ms. Allocated memory was 198.2MB in the beginning and 741.3MB in the end (delta: 543.2MB). Free memory was 135.7MB in the beginning and 245.9MB in the end (delta: -110.2MB). Peak memory consumption was 543.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 104 PlacesBefore, 42 PlacesAfterwards, 106 TransitionsBefore, 41 TransitionsAfterwards, 3192 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 68 TotalNumberOfCompositions, 8972 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2382, positive: 2051, positive conditional: 0, positive unconditional: 2051, negative: 331, negative conditional: 0, negative unconditional: 331, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1453, positive: 1405, positive conditional: 0, positive unconditional: 1405, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2382, positive: 646, positive conditional: 0, positive unconditional: 646, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 1453, unknown conditional: 0, unknown unconditional: 1453] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 20:19:30,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...