/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -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/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 22:26:00,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 22:26:00,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 22:26:00,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 22:26:00,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 22:26:00,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 22:26:00,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 22:26:00,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 22:26:00,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 22:26:00,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 22:26:00,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 22:26:00,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 22:26:00,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 22:26:00,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 22:26:00,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 22:26:00,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 22:26:00,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 22:26:00,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 22:26:00,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 22:26:00,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 22:26:00,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 22:26:00,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 22:26:00,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 22:26:00,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 22:26:00,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 22:26:00,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 22:26:00,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 22:26:00,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 22:26:00,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 22:26:00,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 22:26:00,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 22:26:00,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 22:26:00,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 22:26:00,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 22:26:00,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 22:26:00,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 22:26:00,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 22:26:00,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 22:26:00,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 22:26:00,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 22:26:00,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 22:26:00,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-09 22:26:00,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 22:26:00,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 22:26:00,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 22:26:00,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 22:26:00,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 22:26:00,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 22:26:00,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 22:26:00,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 22:26:00,382 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 22:26:00,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 22:26:00,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 22:26:00,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 22:26:00,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:26:00,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 22:26:00,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-09 22:26:00,386 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION 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-11-09 22:26:00,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 22:26:00,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 22:26:00,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 22:26:00,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 22:26:00,597 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 22:26:00,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2022-11-09 22:26:00,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbd27dfd/47fac762b4c7424fa35eb459f66d1149/FLAG5e3844f74 [2022-11-09 22:26:01,035 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 22:26:01,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2022-11-09 22:26:01,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbd27dfd/47fac762b4c7424fa35eb459f66d1149/FLAG5e3844f74 [2022-11-09 22:26:01,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbd27dfd/47fac762b4c7424fa35eb459f66d1149 [2022-11-09 22:26:01,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 22:26:01,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 22:26:01,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 22:26:01,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 22:26:01,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 22:26:01,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff7b2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01, skipping insertion in model container [2022-11-09 22:26:01,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 22:26:01,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 22:26:01,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] [2022-11-09 22:26:01,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:26:01,786 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 22:26:01,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] [2022-11-09 22:26:01,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 22:26:01,886 INFO L208 MainTranslator]: Completed translation [2022-11-09 22:26:01,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01 WrapperNode [2022-11-09 22:26:01,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 22:26:01,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 22:26:01,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 22:26:01,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 22:26:01,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,951 INFO L138 Inliner]: procedures = 277, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 205 [2022-11-09 22:26:01,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 22:26:01,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 22:26:01,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 22:26:01,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 22:26:01,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:01,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 22:26:02,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 22:26:02,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 22:26:02,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 22:26:02,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (1/1) ... [2022-11-09 22:26:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 22:26:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:02,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-09 22:26:02,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-09 22:26:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-09 22:26:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-09 22:26:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 22:26:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 22:26:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 22:26:02,052 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 22:26:02,210 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 22:26:02,211 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 22:26:02,471 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 22:26:02,478 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 22:26:02,478 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-09 22:26:02,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:02 BoogieIcfgContainer [2022-11-09 22:26:02,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 22:26:02,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 22:26:02,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 22:26:02,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 22:26:02,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:01" (1/3) ... [2022-11-09 22:26:02,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76f6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:02, skipping insertion in model container [2022-11-09 22:26:02,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:01" (2/3) ... [2022-11-09 22:26:02,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c76f6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:02, skipping insertion in model container [2022-11-09 22:26:02,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:02" (3/3) ... [2022-11-09 22:26:02,486 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-11-09 22:26:02,491 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 22:26:02,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 22:26:02,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-09 22:26:02,497 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 22:26:02,608 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 22:26:02,664 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-09 22:26:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 22:26:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:02,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 22:26:02,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-09 22:26:02,708 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 22:26:02,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE ======== [2022-11-09 22:26:02,724 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fcaccd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 22:26:02,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-09 22:26:03,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -258846343, now seen corresponding path program 1 times [2022-11-09 22:26:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962914588] [2022-11-09 22:26:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:03,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962914588] [2022-11-09 22:26:03,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962914588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:03,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:03,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 22:26:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83558358] [2022-11-09 22:26:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:03,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 22:26:03,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 22:26:03,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:26:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:03,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:03,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:03,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:04,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 22:26:04,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -209756205, now seen corresponding path program 1 times [2022-11-09 22:26:04,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:04,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410165230] [2022-11-09 22:26:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-09 22:26:04,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410165230] [2022-11-09 22:26:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410165230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:04,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:04,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:26:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944716812] [2022-11-09 22:26:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:26:04,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:04,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:04,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 22:26:04,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 876588100, now seen corresponding path program 1 times [2022-11-09 22:26:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:04,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796866026] [2022-11-09 22:26:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:05,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796866026] [2022-11-09 22:26:05,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796866026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:05,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:05,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127076634] [2022-11-09 22:26:05,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:05,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:05,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:05,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:05,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:05,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:05,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:06,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 22:26:06,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1531860942, now seen corresponding path program 1 times [2022-11-09 22:26:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:06,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351728971] [2022-11-09 22:26:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:06,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 119 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-09 22:26:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351728971] [2022-11-09 22:26:06,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351728971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852502388] [2022-11-09 22:26:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:06,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:06,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:06,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:26:06,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-09 22:26:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:06,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-09 22:26:06,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-09 22:26:06,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-09 22:26:06,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852502388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:06,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-09 22:26:06,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-09 22:26:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505529407] [2022-11-09 22:26:06,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:06,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:06,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-09 22:26:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:06,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:06,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:06,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-09 22:26:07,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-09 22:26:07,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:07,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:07,145 INFO L85 PathProgramCache]: Analyzing trace with hash -469631698, now seen corresponding path program 2 times [2022-11-09 22:26:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:07,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403464265] [2022-11-09 22:26:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-09 22:26:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403464265] [2022-11-09 22:26:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403464265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394793462] [2022-11-09 22:26:07,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:26:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:07,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:07,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:26:07,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-09 22:26:07,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:26:07,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:07,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-09 22:26:07,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-09 22:26:07,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 173 proven. 20 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-09 22:26:07,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394793462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:07,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:07,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-09 22:26:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138150755] [2022-11-09 22:26:07,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:07,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-09 22:26:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:07,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-09 22:26:07,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-09 22:26:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:07,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:07,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.8) internal successors, (398), 10 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:07,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:07,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:07,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:07,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:07,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-09 22:26:07,933 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-11-09 22:26:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:08,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 178868799, now seen corresponding path program 1 times [2022-11-09 22:26:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:08,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378874366] [2022-11-09 22:26:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378874366] [2022-11-09 22:26:08,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378874366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054773791] [2022-11-09 22:26:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:08,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:26:08,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-09 22:26:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:08,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:08,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:09,060 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:09,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:26:09,133 INFO L390 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-11-09 22:26:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,159 INFO L390 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-11-09 22:26:09,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,190 INFO L390 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-11-09 22:26:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:26:09,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,691 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,715 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:09,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:09,736 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:09,755 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:10,386 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-09 22:26:10,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:10,432 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:26:10,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:26:10,575 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)))) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:26:17,843 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_374 (Array Int Int))) (= (select (select (store .cse0 |c_~#arr~0.base| v_ArrVal_374) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:26:17,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:17,996 INFO L390 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2022-11-09 22:26:18,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:18,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2022-11-09 22:26:18,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 22:26:18,077 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:18,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:26:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 18 not checked. [2022-11-09 22:26:18,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054773791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:18,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:18,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2022-11-09 22:26:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863974752] [2022-11-09 22:26:18,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:18,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-09 22:26:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-09 22:26:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=671, Unknown=48, NotChecked=244, Total=1190 [2022-11-09 22:26:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:18,086 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 11.029411764705882) internal successors, (375), 35 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-09 22:26:18,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:26:21,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-09 22:26:21,456 WARN L477 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-11-09 22:26:21,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2058315890, now seen corresponding path program 2 times [2022-11-09 22:26:21,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:21,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114137215] [2022-11-09 22:26:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:21,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:22,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114137215] [2022-11-09 22:26:22,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114137215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:22,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436293854] [2022-11-09 22:26:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:22,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:26:22,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:26:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:24,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 22:26:24,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash 406515081, now seen corresponding path program 2 times [2022-11-09 22:26:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:24,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551290276] [2022-11-09 22:26:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551290276] [2022-11-09 22:26:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551290276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586099014] [2022-11-09 22:26:25,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:26:25,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:25,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:25,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:26:25,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-09 22:26:25,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:26:25,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:25,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:25,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:25,645 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:25,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:26:25,716 INFO L390 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-11-09 22:26:25,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:25,741 INFO L390 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-11-09 22:26:25,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:25,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:25,778 INFO L390 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-11-09 22:26:26,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,287 INFO L390 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 32 treesize of output 30 [2022-11-09 22:26:26,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:26:26,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,439 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:26,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:26,461 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:26,476 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:27,360 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:27,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:27,439 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:26:27,576 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:26:27,600 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:26:27,952 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:26:27,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-09 22:26:28,006 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:26:28,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_489 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_489) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-09 22:26:28,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-09 22:26:28,461 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse5 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_484))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_490) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:26:28,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:28,523 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-09 22:26:28,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:28,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 60 [2022-11-09 22:26:28,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 22:26:28,602 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:28,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:26:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-09 22:26:28,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586099014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:28,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:28,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2022-11-09 22:26:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282150764] [2022-11-09 22:26:28,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-09 22:26:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-09 22:26:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=665, Unknown=9, NotChecked=576, Total=1482 [2022-11-09 22:26:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:28,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.526315789473685) internal successors, (400), 39 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:28,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-09 22:26:28,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:36,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-09 22:26:36,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:36,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash -77886242, now seen corresponding path program 3 times [2022-11-09 22:26:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:36,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231537511] [2022-11-09 22:26:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:36,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:36,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231537511] [2022-11-09 22:26:36,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231537511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:36,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:36,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-09 22:26:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748665599] [2022-11-09 22:26:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:36,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-09 22:26:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:36,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-09 22:26:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-09 22:26:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:36,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:36,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:36,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:44,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:44,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 22:26:44,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash -940350759, now seen corresponding path program 3 times [2022-11-09 22:26:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878880339] [2022-11-09 22:26:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:44,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:44,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878880339] [2022-11-09 22:26:44,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878880339] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:26:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853160596] [2022-11-09 22:26:44,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:26:44,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:44,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:26:44,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:26:44,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-09 22:26:44,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-09 22:26:44,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:26:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:26:44,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:26:44,939 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:26:44,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:26:45,024 INFO L390 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-11-09 22:26:45,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,050 INFO L390 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-11-09 22:26:45,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,462 INFO L390 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 23 treesize of output 23 [2022-11-09 22:26:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,476 INFO L390 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-11-09 22:26:45,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:26:45,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,572 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:45,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:26:45,588 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:45,605 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:46,447 INFO L390 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 41 treesize of output 37 [2022-11-09 22:26:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:26:46,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:26:46,515 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:26:46,628 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_606 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:26:47,016 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:26:47,048 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:26:47,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_605) |c_~#arr~0.base| v_ArrVal_606) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse2) 0))))) is different from false [2022-11-09 22:26:47,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:47,632 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2022-11-09 22:26:47,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:26:47,637 INFO L390 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 70 treesize of output 56 [2022-11-09 22:26:47,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 22:26:47,712 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:26:47,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:26:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 13 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-09 22:26:47,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853160596] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:26:47,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:26:47,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2022-11-09 22:26:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155715544] [2022-11-09 22:26:47,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:26:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-09 22:26:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-09 22:26:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=855, Unknown=28, NotChecked=340, Total=1482 [2022-11-09 22:26:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:47,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:47,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.526315789473685) internal successors, (400), 39 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:47,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:47,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:47,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:55,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-09 22:26:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:26:55,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:26:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:26:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -705670000, now seen corresponding path program 1 times [2022-11-09 22:26:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:26:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062731958] [2022-11-09 22:26:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:26:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:26:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:26:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6712 backedges. 3876 proven. 0 refuted. 0 times theorem prover too weak. 2836 trivial. 0 not checked. [2022-11-09 22:26:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:26:55,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062731958] [2022-11-09 22:26:55,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062731958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:26:55,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:26:55,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:26:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490695372] [2022-11-09 22:26:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:26:55,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:26:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:26:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:26:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:26:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:26:55,561 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:26:55,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:26:55,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:26:55,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:55,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:55,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:26:55,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:04,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-09 22:27:04,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash -236940038, now seen corresponding path program 1 times [2022-11-09 22:27:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:04,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204381454] [2022-11-09 22:27:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20066 backedges. 5116 proven. 0 refuted. 0 times theorem prover too weak. 14950 trivial. 0 not checked. [2022-11-09 22:27:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204381454] [2022-11-09 22:27:06,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204381454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:27:06,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:27:06,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 22:27:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77410690] [2022-11-09 22:27:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:27:06,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 22:27:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:06,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 22:27:06,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 22:27:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:06,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:06,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:06,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:06,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:06,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:06,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:07,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-09 22:27:07,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1421917105, now seen corresponding path program 4 times [2022-11-09 22:27:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:07,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415480455] [2022-11-09 22:27:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:07,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:07,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415480455] [2022-11-09 22:27:07,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415480455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:07,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915771956] [2022-11-09 22:27:07,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:27:07,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:07,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:07,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:27:07,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-09 22:27:08,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:27:08,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:08,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:08,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:08,089 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:08,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:27:08,167 INFO L390 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-11-09 22:27:08,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,194 INFO L390 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-11-09 22:27:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,620 INFO L390 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 23 treesize of output 23 [2022-11-09 22:27:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,644 INFO L390 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-11-09 22:27:08,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,706 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:08,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:27:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:08,785 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:08,805 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:09,681 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:09,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:09,753 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:09,845 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:27:09,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1313 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:27:10,156 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:27:10,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:27:10,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1308))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1308))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1308))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1308))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)))) is different from false [2022-11-09 22:27:10,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1308))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1308))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1308))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1308))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1312) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:10,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5 0)))) (and (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_~#arr~0.base| v_ArrVal_1308))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (let ((.cse3 (store .cse2 |c_~#arr~0.base| v_ArrVal_1308))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_~#arr~0.base| v_ArrVal_1308))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_1313 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_~#arr~0.base| v_ArrVal_1308))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1313) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-09 22:27:10,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:10,693 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-09 22:27:10,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:10,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 60 [2022-11-09 22:27:10,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 22:27:10,813 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:10,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:27:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-09 22:27:10,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915771956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:10,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:10,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 38 [2022-11-09 22:27:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954694148] [2022-11-09 22:27:10,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:10,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-09 22:27:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-09 22:27:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=720, Unknown=8, NotChecked=520, Total=1482 [2022-11-09 22:27:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:10,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.526315789473685) internal successors, (400), 39 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:10,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:12,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-09 22:27:13,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:13,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1380593635, now seen corresponding path program 5 times [2022-11-09 22:27:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:13,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465519321] [2022-11-09 22:27:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465519321] [2022-11-09 22:27:13,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465519321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568897313] [2022-11-09 22:27:13,685 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-09 22:27:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:13,687 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:27:13,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-09 22:27:13,835 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:27:13,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:13,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:13,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:13,880 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:13,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:27:13,955 INFO L390 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-11-09 22:27:13,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:13,980 INFO L390 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-11-09 22:27:14,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,315 INFO L390 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 23 treesize of output 23 [2022-11-09 22:27:14,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,329 INFO L390 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-11-09 22:27:14,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,374 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:14,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,391 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:14,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:14,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:27:14,463 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:15,358 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:15,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:15,423 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:27:15,526 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:15,560 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1404 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))))) is different from false [2022-11-09 22:27:15,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:15,933 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:15,944 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:27:15,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5 0)))) (and (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1))) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1400 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1400))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1403) |c_~#arr~0.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:27:16,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:16,732 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 77 [2022-11-09 22:27:16,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:16,738 INFO L390 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 130 treesize of output 116 [2022-11-09 22:27:16,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-09 22:27:16,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-09 22:27:16,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-09 22:27:16,851 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:16,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:27:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 31 not checked. [2022-11-09 22:27:16,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568897313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:16,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:16,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 38 [2022-11-09 22:27:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729291460] [2022-11-09 22:27:16,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-09 22:27:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-09 22:27:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=769, Unknown=23, NotChecked=462, Total=1482 [2022-11-09 22:27:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:16,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:16,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.5) internal successors, (399), 39 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:16,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:27:18,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-09 22:27:18,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-09 22:27:18,948 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash 151279809, now seen corresponding path program 6 times [2022-11-09 22:27:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:18,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778867078] [2022-11-09 22:27:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778867078] [2022-11-09 22:27:19,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778867078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55280186] [2022-11-09 22:27:19,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-09 22:27:19,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:19,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:27:19,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-09 22:27:19,837 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-09 22:27:19,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:27:19,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-09 22:27:19,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:19,882 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:19,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:27:19,962 INFO L390 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-11-09 22:27:19,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:19,988 INFO L390 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-11-09 22:27:20,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,382 INFO L390 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 23 treesize of output 23 [2022-11-09 22:27:20,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,396 INFO L390 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-11-09 22:27:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,440 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,459 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:20,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:27:20,526 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:21,665 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:21,688 INFO L390 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 41 treesize of output 37 [2022-11-09 22:27:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:21,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:21,774 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:21,901 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:21,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1500 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:27:26,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:26,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1495 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1495))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1495 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1495))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1495 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1495))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1495 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1495))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1498) |c_~#arr~0.base| v_ArrVal_1500) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:27:27,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:27,506 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 77 [2022-11-09 22:27:27,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:27:27,511 INFO L390 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 130 treesize of output 116 [2022-11-09 22:27:27,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-11-09 22:27:27,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-09 22:27:27,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-09 22:27:27,632 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:27,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:27:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-11-09 22:27:27,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55280186] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:27,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:27,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 39 [2022-11-09 22:27:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727995678] [2022-11-09 22:27:27,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:27,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-09 22:27:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-09 22:27:27,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=889, Unknown=53, NotChecked=350, Total=1560 [2022-11-09 22:27:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:27,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:27,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 10.333333333333334) internal successors, (403), 40 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:27,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:27,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:27,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:27,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:27,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:27:27,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:27:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:29,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-09 22:27:30,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-09 22:27:30,132 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:27:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:27:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1904859581, now seen corresponding path program 7 times [2022-11-09 22:27:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:27:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365731819] [2022-11-09 22:27:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:27:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:27:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:27:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365731819] [2022-11-09 22:27:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365731819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:27:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134554333] [2022-11-09 22:27:30,772 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-09 22:27:30,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:27:30,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:27:30,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:27:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-09 22:27:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:27:30,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-09 22:27:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:27:30,981 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:27:30,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:27:31,077 INFO L390 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-11-09 22:27:31,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,108 INFO L390 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-11-09 22:27:31,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,522 INFO L390 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 23 treesize of output 23 [2022-11-09 22:27:31,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,543 INFO L390 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-11-09 22:27:31,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,584 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:31,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,605 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:31,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:31,623 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:32,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:32,444 INFO L390 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 32 treesize of output 30 [2022-11-09 22:27:32,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:32,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:27:32,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:27:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:27:32,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:27:32,549 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:27:32,635 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1589 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:27:55,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:27:55,876 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1583))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1583))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1583))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:27:55,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1583))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1583))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1583))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1588) |c_~#arr~0.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:27:56,199 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:27:56,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:27:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 13 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-09 22:27:56,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134554333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:27:56,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:27:56,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 33 [2022-11-09 22:27:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123895594] [2022-11-09 22:27:56,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:27:56,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-09 22:27:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:27:56,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-09 22:27:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=625, Unknown=45, NotChecked=290, Total=1122 [2022-11-09 22:27:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:27:56,206 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:27:56,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 11.06060606060606) internal successors, (365), 34 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:27:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-09 22:27:56,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-09 22:28:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:01,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-09 22:28:01,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-09 22:28:01,938 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1504684994, now seen corresponding path program 8 times [2022-11-09 22:28:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:01,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083259600] [2022-11-09 22:28:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 42 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:03,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:03,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083259600] [2022-11-09 22:28:03,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083259600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:03,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188865623] [2022-11-09 22:28:03,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-09 22:28:03,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:03,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:03,330 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:28:03,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-09 22:28:03,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-09 22:28:03,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:03,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-09 22:28:03,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:03,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:28:03,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:28:03,638 INFO L390 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-11-09 22:28:03,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:03,669 INFO L390 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-11-09 22:28:04,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,020 INFO L390 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 23 treesize of output 23 [2022-11-09 22:28:04,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,029 INFO L390 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-11-09 22:28:04,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,067 INFO L390 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 32 treesize of output 30 [2022-11-09 22:28:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,095 INFO L390 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 32 treesize of output 30 [2022-11-09 22:28:04,108 INFO L390 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 32 treesize of output 30 [2022-11-09 22:28:04,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,785 INFO L390 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 32 treesize of output 30 [2022-11-09 22:28:04,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:28:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,851 INFO L390 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 41 treesize of output 37 [2022-11-09 22:28:04,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:04,874 INFO L390 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 41 treesize of output 37 [2022-11-09 22:28:04,891 INFO L390 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 41 treesize of output 37 [2022-11-09 22:28:05,898 INFO L390 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 41 treesize of output 37 [2022-11-09 22:28:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:05,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:06,020 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:06,160 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:28:06,192 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1714 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_1714 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:28:14,888 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:28:14,905 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1708))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1708))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1708))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1708))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:28:15,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1708))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1708))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1708))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1708))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_1713) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:28:15,121 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1708))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1708))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= 0 (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1708))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_1708))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:28:15,559 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1707) |c_~#arr~0.base| v_ArrVal_1708))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1707) |c_~#arr~0.base| v_ArrVal_1708))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (= 0 (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1707) |c_~#arr~0.base| v_ArrVal_1708))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1707 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1707) |c_~#arr~0.base| v_ArrVal_1708))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_1714) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:28:16,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:16,335 INFO L390 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-11-09 22:28:16,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:28:16,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 60 [2022-11-09 22:28:16,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-09 22:28:16,418 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:28:16,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:28:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 126 not checked. [2022-11-09 22:28:16,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188865623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:16,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:16,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 18] total 48 [2022-11-09 22:28:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563349086] [2022-11-09 22:28:16,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-09 22:28:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-09 22:28:16,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1270, Unknown=95, NotChecked=680, Total=2352 [2022-11-09 22:28:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:16,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:16,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 10.895833333333334) internal successors, (523), 49 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:16,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:16,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:28:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:28:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:28:29,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-09 22:28:29,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-09 22:28:29,478 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -517803462, now seen corresponding path program 1 times [2022-11-09 22:28:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440907538] [2022-11-09 22:28:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 46 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:29,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440907538] [2022-11-09 22:28:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440907538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129594532] [2022-11-09 22:28:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:29,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:29,679 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-09 22:28:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-09 22:28:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:29,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-09 22:28:29,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 46 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:30,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 46 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:30,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129594532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:28:30,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:28:30,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-09 22:28:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790183087] [2022-11-09 22:28:30,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:28:30,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-09 22:28:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:28:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-09 22:28:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-09 22:28:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:30,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:28:30,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 36.72222222222222) internal successors, (661), 18 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:28:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:28:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:28:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:28:38,776 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-11-09 22:28:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-09 22:28:38,963 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:28:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:28:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1636294713, now seen corresponding path program 9 times [2022-11-09 22:28:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:28:38,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537855526] [2022-11-09 22:28:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:28:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:28:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:28:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:28:40,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:28:40,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537855526] [2022-11-09 22:28:40,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537855526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:28:40,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695934849] [2022-11-09 22:28:40,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-09 22:28:40,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:28:40,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:28:40,740 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-11-09 22:28:40,741 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-11-09 22:28:41,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-09 22:28:41,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:28:41,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-09 22:28:41,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:28:41,358 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-09 22:28:41,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-09 22:28:41,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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-11-09 22:28:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:41,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-11-09 22:28:42,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:42,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:42,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:42,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:42,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:42,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:44,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:44,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:44,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:44,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-09 22:28:44,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:44,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 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-11-09 22:28:44,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:44,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:44,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:45,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:45,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-09 22:28:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:45,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:45,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 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-11-09 22:28:46,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:46,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:28:46,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:46,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:49,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-09 22:28:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 199 proven. 54 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-09 22:28:49,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:28:49,750 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:28:49,891 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:28:49,922 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#race| |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0))) is different from false [2022-11-09 22:28:59,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))))) is different from false [2022-11-09 22:28:59,564 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2001))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2001))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2001))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-09 22:28:59,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2001))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2001))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2006 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2001))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2006) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)))) is different from false [2022-11-09 22:28:59,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2001))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2001))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2001))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:29:00,321 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= 0 (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)))) is different from false [2022-11-09 22:29:00,356 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4 0))) (.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2001 (Array Int Int)) (v_ArrVal_2000 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2000) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0))))) is different from false [2022-11-09 22:29:01,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_1996 (Array Int Int)) (v_ArrVal_2007 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1994) |c_~#arr~0.base| v_ArrVal_1996))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1996 (Array Int Int)) (v_ArrVal_2007 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (let ((.cse5 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1994) |c_~#arr~0.base| v_ArrVal_1996))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_1996 (Array Int Int)) (v_ArrVal_2007 (Array Int Int)) (v_ArrVal_1994 (Array Int Int)) (v_ArrVal_2001 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (let ((.cse7 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_1994) |c_~#arr~0.base| v_ArrVal_1996))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_~#arr~0.base| v_ArrVal_2001))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2007) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)))) is different from false [2022-11-09 22:29:01,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:01,861 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 77 [2022-11-09 22:29:01,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:01,867 INFO L390 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 130 treesize of output 116 [2022-11-09 22:29:01,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-09 22:29:01,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-09 22:29:01,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2022-11-09 22:29:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 3 proven. 0 refuted. 1 times theorem prover too weak. 13 trivial. 268 not checked. [2022-11-09 22:29:02,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695934849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:02,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:02,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 61 [2022-11-09 22:29:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009154125] [2022-11-09 22:29:02,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-09 22:29:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-09 22:29:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2254, Unknown=41, NotChecked=1090, Total=3782 [2022-11-09 22:29:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:02,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:02,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 12.540983606557377) internal successors, (765), 62 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:02,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:14,531 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-11-09 22:29:14,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:14,715 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 725973151, now seen corresponding path program 10 times [2022-11-09 22:29:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:14,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180623625] [2022-11-09 22:29:14,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:16,248 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 148 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:29:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180623625] [2022-11-09 22:29:16,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180623625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602170151] [2022-11-09 22:29:16,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-09 22:29:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:16,250 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-11-09 22:29:16,251 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-11-09 22:29:16,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-09 22:29:16,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-09 22:29:16,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-09 22:29:16,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:16,903 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-09 22:29:16,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-09 22:29:16,967 INFO L390 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-11-09 22:29:16,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:16,997 INFO L390 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-11-09 22:29:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,317 INFO L390 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 23 treesize of output 23 [2022-11-09 22:29:17,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,332 INFO L390 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 23 treesize of output 23 [2022-11-09 22:29:17,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,343 INFO L390 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 23 treesize of output 23 [2022-11-09 22:29:17,355 INFO L390 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 23 [2022-11-09 22:29:17,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,873 INFO L390 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 23 treesize of output 23 [2022-11-09 22:29:17,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,885 INFO L390 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 23 treesize of output 23 [2022-11-09 22:29:17,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,899 INFO L390 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-11-09 22:29:17,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:17,940 INFO L390 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 32 treesize of output 30 [2022-11-09 22:29:17,959 INFO L390 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 32 treesize of output 30 [2022-11-09 22:29:18,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,578 INFO L390 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 32 treesize of output 30 [2022-11-09 22:29:18,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,597 INFO L390 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 32 treesize of output 30 [2022-11-09 22:29:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-11-09 22:29:18,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-09 22:29:18,665 INFO L390 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 41 treesize of output 37 [2022-11-09 22:29:18,682 INFO L390 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 41 treesize of output 37 [2022-11-09 22:29:19,522 INFO L390 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 41 treesize of output 37 [2022-11-09 22:29:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 199 proven. 54 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-09 22:29:19,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:19,574 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0))) is different from false [2022-11-09 22:29:19,669 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0))) is different from false [2022-11-09 22:29:20,052 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))) is different from false [2022-11-09 22:29:20,081 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= 0 (select (select (store (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1))))))) is different from false [2022-11-09 22:29:20,095 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2157))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2157))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)))) is different from false [2022-11-09 22:29:20,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2157))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2157))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse4 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2161) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)))))) is different from false [2022-11-09 22:29:20,274 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1))) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2157))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2157))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| |c_~#arr~0.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)))))) is different from false [2022-11-09 22:29:20,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse2 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse3 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)))) is different from false [2022-11-09 22:29:20,645 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0)))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse5 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store .cse2 |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0))))) is different from false [2022-11-09 22:29:20,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2151))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store (let ((.cse5 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2151))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2151))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= 0 (select (select (store (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2151))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3))))) is different from false [2022-11-09 22:29:20,997 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 3)) (.cse3 (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 2))) (and (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store (let ((.cse2 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2151))) (store .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (store (let ((.cse5 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2151))) (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) (+ |c_ULTIMATE.start_main_~#id1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2151))) (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2151 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (= 0 (select (select (store (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2151))) (store .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse3 0))) |c_t1Thread1of1ForFork0_push_#in~stack#1.base| v_ArrVal_2155) |c_~#arr~0.base| v_ArrVal_2157))) (store .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#id1~0#1.base|) .cse1 0))) |c_~#arr~0.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~#id1~0#1.base|) |c_ULTIMATE.start_main_~#id1~0#1.offset|))))) is different from false [2022-11-09 22:29:22,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:22,311 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 77 [2022-11-09 22:29:22,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-09 22:29:22,315 INFO L390 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 130 treesize of output 116 [2022-11-09 22:29:22,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-11-09 22:29:22,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-09 22:29:22,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-09 22:29:22,392 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-09 22:29:22,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-09 22:29:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 56 times theorem prover too weak. 13 trivial. 216 not checked. [2022-11-09 22:29:22,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602170151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:22,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:22,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 21] total 55 [2022-11-09 22:29:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996792700] [2022-11-09 22:29:22,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:22,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-09 22:29:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-09 22:29:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1592, Unknown=68, NotChecked=1056, Total=3080 [2022-11-09 22:29:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:22,401 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:22,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 13.727272727272727) internal successors, (755), 56 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:22,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:22,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:39,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-09 22:29:39,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-09 22:29:39,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:39,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1267557152, now seen corresponding path program 1 times [2022-11-09 22:29:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180531833] [2022-11-09 22:29:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 1484 trivial. 0 not checked. [2022-11-09 22:29:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:40,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180531833] [2022-11-09 22:29:40,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180531833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 22:29:40,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 22:29:40,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 22:29:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733320582] [2022-11-09 22:29:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 22:29:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-09 22:29:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:40,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-09 22:29:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-09 22:29:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:40,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:40,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:29:40,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-09 22:29:40,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:54,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-09 22:29:54,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:54,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-09 22:29:54,014 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE] === [2022-11-09 22:29:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 22:29:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1511968634, now seen corresponding path program 1 times [2022-11-09 22:29:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 22:29:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711883567] [2022-11-09 22:29:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 22:29:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 335 proven. 1484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:29:54,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 22:29:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711883567] [2022-11-09 22:29:54,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711883567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 22:29:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138501765] [2022-11-09 22:29:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 22:29:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-09 22:29:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 22:29:54,656 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-11-09 22:29:54,657 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-11-09 22:29:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 22:29:54,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-09 22:29:54,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-09 22:29:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 335 proven. 1484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:29:55,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-09 22:29:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 335 proven. 1484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 22:29:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138501765] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-09 22:29:56,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-09 22:29:56,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-09 22:29:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401240131] [2022-11-09 22:29:56,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-09 22:29:56,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-09 22:29:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 22:29:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-09 22:29:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-09 22:29:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 22:29:56,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 22:29:56,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 35.705882352941174) internal successors, (1214), 34 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-09 22:29:56,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-09 22:29:56,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-09 22:29:56,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 22:29:56,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.