/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 15:08:16,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 15:08:16,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 15:08:16,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 15:08:16,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 15:08:16,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 15:08:16,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 15:08:16,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 15:08:16,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 15:08:16,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 15:08:16,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 15:08:16,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 15:08:16,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 15:08:16,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 15:08:16,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 15:08:16,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 15:08:16,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 15:08:16,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 15:08:16,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 15:08:16,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 15:08:16,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 15:08:16,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 15:08:16,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 15:08:16,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 15:08:16,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 15:08:16,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 15:08:16,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 15:08:16,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 15:08:16,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 15:08:16,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 15:08:16,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 15:08:16,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 15:08:16,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 15:08:16,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 15:08:16,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 15:08:16,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 15:08:16,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 15:08:16,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 15:08:16,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 15:08:16,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 15:08:16,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 15:08:16,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-15 15:08:16,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 15:08:16,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 15:08:16,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-15 15:08:16,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-15 15:08:16,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 15:08:16,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 15:08:16,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 15:08:16,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 15:08:16,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 15:08:16,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 15:08:16,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 15:08:16,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 15:08:16,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 15:08:16,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 15:08:16,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:08:16,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 15:08:16,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 15:08:16,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 15:08:17,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 15:08:17,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 15:08:17,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 15:08:17,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 15:08:17,168 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 15:08:17,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-15 15:08:17,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8e80ef8/c7d223e679b84ccba466b9b2c26a3f58/FLAGfa71319c5 [2022-03-15 15:08:17,653 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 15:08:17,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2022-03-15 15:08:17,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8e80ef8/c7d223e679b84ccba466b9b2c26a3f58/FLAGfa71319c5 [2022-03-15 15:08:18,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f8e80ef8/c7d223e679b84ccba466b9b2c26a3f58 [2022-03-15 15:08:18,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 15:08:18,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 15:08:18,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 15:08:18,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 15:08:18,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 15:08:18,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240c5ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18, skipping insertion in model container [2022-03-15 15:08:18,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 15:08:18,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 15:08:18,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:08:18,510 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 15:08:18,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 15:08:18,613 INFO L208 MainTranslator]: Completed translation [2022-03-15 15:08:18,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18 WrapperNode [2022-03-15 15:08:18,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 15:08:18,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 15:08:18,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 15:08:18,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 15:08:18,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,681 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-03-15 15:08:18,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 15:08:18,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 15:08:18,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 15:08:18,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 15:08:18,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 15:08:18,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 15:08:18,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 15:08:18,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 15:08:18,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (1/1) ... [2022-03-15 15:08:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 15:08:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:18,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 15:08:18,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 15:08:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 15:08:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 15:08:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 15:08:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 15:08:18,790 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 15:08:18,932 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 15:08:18,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 15:08:19,108 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 15:08:19,114 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 15:08:19,115 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 15:08:19,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:08:19 BoogieIcfgContainer [2022-03-15 15:08:19,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 15:08:19,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 15:08:19,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 15:08:19,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 15:08:19,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:08:18" (1/3) ... [2022-03-15 15:08:19,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621eeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:08:19, skipping insertion in model container [2022-03-15 15:08:19,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:08:18" (2/3) ... [2022-03-15 15:08:19,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621eeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:08:19, skipping insertion in model container [2022-03-15 15:08:19,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:08:19" (3/3) ... [2022-03-15 15:08:19,123 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-03-15 15:08:19,127 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 15:08:19,127 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-15 15:08:19,127 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-03-15 15:08:19,127 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 15:08:19,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,170 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 15:08:19,199 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 15:08:19,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 15:08:19,252 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 15:08:19,253 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-15 15:08:19,265 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 106 transitions, 217 flow [2022-03-15 15:08:19,351 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 15:08:19,375 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:19,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:19,376 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1089390899, now seen corresponding path program 1 times [2022-03-15 15:08:19,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:19,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245714706] [2022-03-15 15:08:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:19,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:19,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245714706] [2022-03-15 15:08:19,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245714706] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:19,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:19,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 15:08:19,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855791315] [2022-03-15 15:08:19,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:19,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 15:08:19,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:19,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 15:08:19,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:08:19,674 INFO L87 Difference]: Start difference. First operand has 1519 states, 1511 states have (on average 2.041694242223693) internal successors, (3085), 1518 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:19,717 INFO L93 Difference]: Finished difference Result 1519 states and 3016 transitions. [2022-03-15 15:08:19,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 15:08:19,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 15:08:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:19,742 INFO L225 Difference]: With dead ends: 1519 [2022-03-15 15:08:19,742 INFO L226 Difference]: Without dead ends: 1519 [2022-03-15 15:08:19,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 15:08:19,748 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:19,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2022-03-15 15:08:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2022-03-15 15:08:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1511 states have (on average 1.9960291197882196) internal successors, (3016), 1518 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3016 transitions. [2022-03-15 15:08:19,861 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3016 transitions. Word has length 35 [2022-03-15 15:08:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:19,862 INFO L470 AbstractCegarLoop]: Abstraction has 1519 states and 3016 transitions. [2022-03-15 15:08:19,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3016 transitions. [2022-03-15 15:08:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 15:08:19,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:19,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:19,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 15:08:19,864 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1960811916, now seen corresponding path program 1 times [2022-03-15 15:08:19,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:19,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589819976] [2022-03-15 15:08:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:19,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:19,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589819976] [2022-03-15 15:08:19,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589819976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:19,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:19,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 15:08:19,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196256689] [2022-03-15 15:08:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:19,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 15:08:19,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 15:08:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:08:19,964 INFO L87 Difference]: Start difference. First operand 1519 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:20,004 INFO L93 Difference]: Finished difference Result 1523 states and 3020 transitions. [2022-03-15 15:08:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 15:08:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 15:08:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:20,014 INFO L225 Difference]: With dead ends: 1523 [2022-03-15 15:08:20,015 INFO L226 Difference]: Without dead ends: 1523 [2022-03-15 15:08:20,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 15:08:20,016 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:20,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-03-15 15:08:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1520. [2022-03-15 15:08:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1512 states have (on average 1.9953703703703705) internal successors, (3017), 1519 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3017 transitions. [2022-03-15 15:08:20,054 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3017 transitions. Word has length 35 [2022-03-15 15:08:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:20,054 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 3017 transitions. [2022-03-15 15:08:20,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3017 transitions. [2022-03-15 15:08:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-15 15:08:20,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:20,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:20,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 15:08:20,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2113524451, now seen corresponding path program 1 times [2022-03-15 15:08:20,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:20,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569881298] [2022-03-15 15:08:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,185 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:20,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569881298] [2022-03-15 15:08:20,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569881298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:20,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182411569] [2022-03-15 15:08:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:20,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 15:08:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:20,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 15:08:20,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:20,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182411569] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:20,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:20,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 15:08:20,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471266643] [2022-03-15 15:08:20,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:20,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:20,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 15:08:20,593 INFO L87 Difference]: Start difference. First operand 1520 states and 3017 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:20,688 INFO L93 Difference]: Finished difference Result 1530 states and 3027 transitions. [2022-03-15 15:08:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 15:08:20,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-03-15 15:08:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:20,695 INFO L225 Difference]: With dead ends: 1530 [2022-03-15 15:08:20,695 INFO L226 Difference]: Without dead ends: 1530 [2022-03-15 15:08:20,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-15 15:08:20,700 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:20,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 385 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-03-15 15:08:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2022-03-15 15:08:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1522 states have (on average 1.9888304862023654) internal successors, (3027), 1529 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3027 transitions. [2022-03-15 15:08:20,736 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3027 transitions. Word has length 40 [2022-03-15 15:08:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:20,736 INFO L470 AbstractCegarLoop]: Abstraction has 1530 states and 3027 transitions. [2022-03-15 15:08:20,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3027 transitions. [2022-03-15 15:08:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 15:08:20,738 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:20,739 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:20,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:20,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:20,960 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 37547901, now seen corresponding path program 2 times [2022-03-15 15:08:20,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:20,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392423179] [2022-03-15 15:08:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:20,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:21,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:21,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392423179] [2022-03-15 15:08:21,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392423179] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:21,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183946049] [2022-03-15 15:08:21,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:21,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:21,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 15:08:21,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:21,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:21,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 15:08:21,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:21,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:08:21,344 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 15:08:21,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:08:21,390 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 15:08:21,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:08:21,453 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 15:08:21,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:08:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 15:08:21,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:21,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183946049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:21,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:21,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-03-15 15:08:21,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558320851] [2022-03-15 15:08:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:21,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:21,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:21,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:21,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:08:21,487 INFO L87 Difference]: Start difference. First operand 1530 states and 3027 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:21,678 INFO L93 Difference]: Finished difference Result 1831 states and 3629 transitions. [2022-03-15 15:08:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:21,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-15 15:08:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:21,686 INFO L225 Difference]: With dead ends: 1831 [2022-03-15 15:08:21,686 INFO L226 Difference]: Without dead ends: 1831 [2022-03-15 15:08:21,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 15:08:21,687 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 136 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:21,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 498 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:08:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2022-03-15 15:08:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1679. [2022-03-15 15:08:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1671 states have (on average 1.9898264512268102) internal successors, (3325), 1678 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3325 transitions. [2022-03-15 15:08:21,727 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3325 transitions. Word has length 50 [2022-03-15 15:08:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:21,727 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 3325 transitions. [2022-03-15 15:08:21,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3325 transitions. [2022-03-15 15:08:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-15 15:08:21,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:21,730 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:21,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:21,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-15 15:08:21,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1921653659, now seen corresponding path program 1 times [2022-03-15 15:08:21,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:21,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21593883] [2022-03-15 15:08:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:22,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21593883] [2022-03-15 15:08:22,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21593883] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:22,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306036381] [2022-03-15 15:08:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:22,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:22,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:22,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 15:08:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 15:08:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:22,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306036381] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:22,376 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:22,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-15 15:08:22,376 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883861292] [2022-03-15 15:08:22,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:22,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 15:08:22,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 15:08:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:22,379 INFO L87 Difference]: Start difference. First operand 1679 states and 3325 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:22,538 INFO L93 Difference]: Finished difference Result 1699 states and 3345 transitions. [2022-03-15 15:08:22,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 15:08:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-03-15 15:08:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:22,544 INFO L225 Difference]: With dead ends: 1699 [2022-03-15 15:08:22,544 INFO L226 Difference]: Without dead ends: 1699 [2022-03-15 15:08:22,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-15 15:08:22,546 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:22,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 480 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 15:08:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-03-15 15:08:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2022-03-15 15:08:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1691 states have (on average 1.978119455943229) internal successors, (3345), 1698 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 3345 transitions. [2022-03-15 15:08:22,603 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 3345 transitions. Word has length 50 [2022-03-15 15:08:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:22,603 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 3345 transitions. [2022-03-15 15:08:22,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 3345 transitions. [2022-03-15 15:08:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-15 15:08:22,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:22,604 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:22,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 15:08:22,831 WARN L452 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-03-15 15:08:22,832 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:22,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1189660581, now seen corresponding path program 2 times [2022-03-15 15:08:22,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:22,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625280899] [2022-03-15 15:08:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:23,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:23,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625280899] [2022-03-15 15:08:23,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625280899] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:23,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719429378] [2022-03-15 15:08:23,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:23,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 15:08:23,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:23,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 15:08:23,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:23,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:08:23,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:08:23,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,350 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:08:23,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:08:23,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:23,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:08:23,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:08:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-03-15 15:08:23,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:23,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719429378] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:23,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:23,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-03-15 15:08:23,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111332272] [2022-03-15 15:08:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:23,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:23,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:08:23,436 INFO L87 Difference]: Start difference. First operand 1699 states and 3345 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:23,888 INFO L93 Difference]: Finished difference Result 3571 states and 7089 transitions. [2022-03-15 15:08:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-03-15 15:08:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:23,902 INFO L225 Difference]: With dead ends: 3571 [2022-03-15 15:08:23,902 INFO L226 Difference]: Without dead ends: 3571 [2022-03-15 15:08:23,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:08:23,903 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 532 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:23,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 1127 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-03-15 15:08:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 2167. [2022-03-15 15:08:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2159 states have (on average 1.982862436313108) internal successors, (4281), 2166 states have internal predecessors, (4281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4281 transitions. [2022-03-15 15:08:23,973 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4281 transitions. Word has length 70 [2022-03-15 15:08:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:23,973 INFO L470 AbstractCegarLoop]: Abstraction has 2167 states and 4281 transitions. [2022-03-15 15:08:23,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4281 transitions. [2022-03-15 15:08:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-15 15:08:23,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:23,975 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:23,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:24,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:24,191 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1998481730, now seen corresponding path program 1 times [2022-03-15 15:08:24,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:24,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234585748] [2022-03-15 15:08:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:24,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:24,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234585748] [2022-03-15 15:08:24,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234585748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:24,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959048648] [2022-03-15 15:08:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:24,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:24,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 15:08:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:24,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 15:08:24,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:24,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:08:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 15:08:24,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959048648] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:08:24,777 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:08:24,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-15 15:08:24,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090099590] [2022-03-15 15:08:24,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:08:24,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 15:08:24,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:24,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 15:08:24,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:24,779 INFO L87 Difference]: Start difference. First operand 2167 states and 4281 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:25,041 INFO L93 Difference]: Finished difference Result 2182 states and 4296 transitions. [2022-03-15 15:08:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:08:25,042 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-03-15 15:08:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:25,049 INFO L225 Difference]: With dead ends: 2182 [2022-03-15 15:08:25,050 INFO L226 Difference]: Without dead ends: 2182 [2022-03-15 15:08:25,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:08:25,051 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 41 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:25,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 764 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:08:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-03-15 15:08:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-03-15 15:08:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2174 states have (on average 1.9760809567617295) internal successors, (4296), 2181 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 4296 transitions. [2022-03-15 15:08:25,091 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 4296 transitions. Word has length 78 [2022-03-15 15:08:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:25,092 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 4296 transitions. [2022-03-15 15:08:25,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 4296 transitions. [2022-03-15 15:08:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 15:08:25,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:25,094 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:25,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:25,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:25,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash 920350873, now seen corresponding path program 2 times [2022-03-15 15:08:25,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:25,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743638056] [2022-03-15 15:08:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:25,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:25,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743638056] [2022-03-15 15:08:25,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743638056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:25,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:25,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:08:25,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055157394] [2022-03-15 15:08:25,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:25,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:25,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,474 INFO L87 Difference]: Start difference. First operand 2182 states and 4296 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:25,601 INFO L93 Difference]: Finished difference Result 2448 states and 4828 transitions. [2022-03-15 15:08:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:25,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-15 15:08:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:25,610 INFO L225 Difference]: With dead ends: 2448 [2022-03-15 15:08:25,610 INFO L226 Difference]: Without dead ends: 2203 [2022-03-15 15:08:25,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,611 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 141 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:25,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 397 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:08:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2022-03-15 15:08:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2098. [2022-03-15 15:08:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2090 states have (on average 1.9684210526315788) internal successors, (4114), 2097 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4114 transitions. [2022-03-15 15:08:25,658 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4114 transitions. Word has length 93 [2022-03-15 15:08:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:25,659 INFO L470 AbstractCegarLoop]: Abstraction has 2098 states and 4114 transitions. [2022-03-15 15:08:25,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4114 transitions. [2022-03-15 15:08:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-15 15:08:25,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:25,663 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:25,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 15:08:25,663 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1018614855, now seen corresponding path program 1 times [2022-03-15 15:08:25,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:25,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693804571] [2022-03-15 15:08:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:25,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:25,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:25,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693804571] [2022-03-15 15:08:25,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693804571] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:25,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:08:25,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:08:25,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609189261] [2022-03-15 15:08:25,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:25,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:08:25,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:25,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:08:25,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,783 INFO L87 Difference]: Start difference. First operand 2098 states and 4114 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:25,931 INFO L93 Difference]: Finished difference Result 2349 states and 4616 transitions. [2022-03-15 15:08:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:08:25,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-15 15:08:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:25,940 INFO L225 Difference]: With dead ends: 2349 [2022-03-15 15:08:25,940 INFO L226 Difference]: Without dead ends: 2349 [2022-03-15 15:08:25,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:08:25,941 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 125 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:25,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:08:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-03-15 15:08:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2229. [2022-03-15 15:08:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2221 states have (on average 1.970283656010806) internal successors, (4376), 2228 states have internal predecessors, (4376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 4376 transitions. [2022-03-15 15:08:25,980 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 4376 transitions. Word has length 93 [2022-03-15 15:08:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:25,980 INFO L470 AbstractCegarLoop]: Abstraction has 2229 states and 4376 transitions. [2022-03-15 15:08:25,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 4376 transitions. [2022-03-15 15:08:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:25,982 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:25,982 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:25,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 15:08:25,983 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1317609396, now seen corresponding path program 1 times [2022-03-15 15:08:25,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:25,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783614532] [2022-03-15 15:08:25,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:25,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:26,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:26,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783614532] [2022-03-15 15:08:26,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783614532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:26,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386976308] [2022-03-15 15:08:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:26,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:26,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 15:08:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:26,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:26,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:26,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:26,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:26,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386976308] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:26,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:26,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:26,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231719859] [2022-03-15 15:08:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:26,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:26,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:26,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:26,665 INFO L87 Difference]: Start difference. First operand 2229 states and 4376 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:27,159 INFO L93 Difference]: Finished difference Result 6535 states and 12955 transitions. [2022-03-15 15:08:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:08:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:27,197 INFO L225 Difference]: With dead ends: 6535 [2022-03-15 15:08:27,197 INFO L226 Difference]: Without dead ends: 6535 [2022-03-15 15:08:27,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:27,198 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 663 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:27,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 1290 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-03-15 15:08:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 2407. [2022-03-15 15:08:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2399 states have (on average 1.964568570237599) internal successors, (4713), 2406 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 4713 transitions. [2022-03-15 15:08:27,272 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 4713 transitions. Word has length 105 [2022-03-15 15:08:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:27,272 INFO L470 AbstractCegarLoop]: Abstraction has 2407 states and 4713 transitions. [2022-03-15 15:08:27,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 4713 transitions. [2022-03-15 15:08:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:27,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:27,275 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:27,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:27,491 WARN L452 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-03-15 15:08:27,491 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1330543596, now seen corresponding path program 2 times [2022-03-15 15:08:27,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:27,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881166365] [2022-03-15 15:08:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:27,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:27,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881166365] [2022-03-15 15:08:27,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881166365] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:27,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110488484] [2022-03-15 15:08:27,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:27,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:27,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:27,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 15:08:27,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:27,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:27,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:28,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:28,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:28,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110488484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:28,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:28,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:28,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604162293] [2022-03-15 15:08:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:28,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:28,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:28,226 INFO L87 Difference]: Start difference. First operand 2407 states and 4713 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:29,309 INFO L93 Difference]: Finished difference Result 5977 states and 11801 transitions. [2022-03-15 15:08:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:08:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:29,322 INFO L225 Difference]: With dead ends: 5977 [2022-03-15 15:08:29,322 INFO L226 Difference]: Without dead ends: 5977 [2022-03-15 15:08:29,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 15:08:29,323 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 1029 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:29,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 1297 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2022-03-15 15:08:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 2486. [2022-03-15 15:08:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2478 states have (on average 1.9580306698950767) internal successors, (4852), 2485 states have internal predecessors, (4852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4852 transitions. [2022-03-15 15:08:29,390 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4852 transitions. Word has length 105 [2022-03-15 15:08:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:29,390 INFO L470 AbstractCegarLoop]: Abstraction has 2486 states and 4852 transitions. [2022-03-15 15:08:29,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4852 transitions. [2022-03-15 15:08:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:29,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:29,392 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:29,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:29,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:29,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -103262266, now seen corresponding path program 3 times [2022-03-15 15:08:29,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:29,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569703735] [2022-03-15 15:08:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:29,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:29,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569703735] [2022-03-15 15:08:29,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569703735] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:29,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195124430] [2022-03-15 15:08:29,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:29,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:29,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:29,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:29,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 15:08:29,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:29,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:29,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:29,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:30,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:30,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:30,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195124430] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:30,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:30,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:30,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610251731] [2022-03-15 15:08:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:30,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:30,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:30,236 INFO L87 Difference]: Start difference. First operand 2486 states and 4852 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:30,694 INFO L93 Difference]: Finished difference Result 6280 states and 12407 transitions. [2022-03-15 15:08:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:08:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:30,708 INFO L225 Difference]: With dead ends: 6280 [2022-03-15 15:08:30,709 INFO L226 Difference]: Without dead ends: 6280 [2022-03-15 15:08:30,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:08:30,710 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 619 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:30,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 1457 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2022-03-15 15:08:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 2495. [2022-03-15 15:08:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2487 states have (on average 1.9581825492561318) internal successors, (4870), 2494 states have internal predecessors, (4870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4870 transitions. [2022-03-15 15:08:30,791 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4870 transitions. Word has length 105 [2022-03-15 15:08:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:30,792 INFO L470 AbstractCegarLoop]: Abstraction has 2495 states and 4870 transitions. [2022-03-15 15:08:30,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4870 transitions. [2022-03-15 15:08:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:30,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:30,794 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:30,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:31,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 15:08:31,012 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1750076570, now seen corresponding path program 4 times [2022-03-15 15:08:31,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:31,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840423655] [2022-03-15 15:08:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:31,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:31,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840423655] [2022-03-15 15:08:31,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840423655] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:31,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830573353] [2022-03-15 15:08:31,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:31,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:31,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:31,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:31,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 15:08:31,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:31,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:31,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 15:08:31,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:31,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:32,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:32,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830573353] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:32,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:32,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:32,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967334085] [2022-03-15 15:08:32,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:32,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:32,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:32,062 INFO L87 Difference]: Start difference. First operand 2495 states and 4870 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:33,091 INFO L93 Difference]: Finished difference Result 7583 states and 14975 transitions. [2022-03-15 15:08:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:08:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:33,107 INFO L225 Difference]: With dead ends: 7583 [2022-03-15 15:08:33,107 INFO L226 Difference]: Without dead ends: 7583 [2022-03-15 15:08:33,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 15:08:33,109 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1024 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:33,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1432 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2022-03-15 15:08:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 2492. [2022-03-15 15:08:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2484 states have (on average 1.9581320450885669) internal successors, (4864), 2491 states have internal predecessors, (4864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4864 transitions. [2022-03-15 15:08:33,174 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4864 transitions. Word has length 105 [2022-03-15 15:08:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:33,175 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 4864 transitions. [2022-03-15 15:08:33,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4864 transitions. [2022-03-15 15:08:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:33,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:33,177 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:33,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:33,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 15:08:33,401 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 412316490, now seen corresponding path program 5 times [2022-03-15 15:08:33,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:33,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599472948] [2022-03-15 15:08:33,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:33,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:33,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599472948] [2022-03-15 15:08:33,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599472948] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:33,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119094731] [2022-03-15 15:08:33,849 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:33,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:33,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 15:08:33,979 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:33,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:33,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:33,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:34,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:34,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:34,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119094731] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:34,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:34,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:34,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800611065] [2022-03-15 15:08:34,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:34,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:34,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:34,400 INFO L87 Difference]: Start difference. First operand 2492 states and 4864 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:35,430 INFO L93 Difference]: Finished difference Result 7733 states and 15280 transitions. [2022-03-15 15:08:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 15:08:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:35,442 INFO L225 Difference]: With dead ends: 7733 [2022-03-15 15:08:35,443 INFO L226 Difference]: Without dead ends: 7733 [2022-03-15 15:08:35,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=2345, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 15:08:35,444 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1165 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:35,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1165 Valid, 1515 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-03-15 15:08:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 2496. [2022-03-15 15:08:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2488 states have (on average 1.9581993569131833) internal successors, (4872), 2495 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:35,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 4872 transitions. [2022-03-15 15:08:35,502 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 4872 transitions. Word has length 105 [2022-03-15 15:08:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:35,502 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 4872 transitions. [2022-03-15 15:08:35,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 4872 transitions. [2022-03-15 15:08:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:35,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:35,504 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:35,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 15:08:35,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 15:08:35,729 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -155675980, now seen corresponding path program 6 times [2022-03-15 15:08:35,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:35,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061202195] [2022-03-15 15:08:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:35,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:35,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061202195] [2022-03-15 15:08:35,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061202195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:35,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497633515] [2022-03-15 15:08:35,880 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:35,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:35,881 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:35,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 15:08:35,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:35,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:35,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:36,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:36,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:36,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:36,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497633515] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:36,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:36,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:36,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860561391] [2022-03-15 15:08:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:36,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:36,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:36,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:36,334 INFO L87 Difference]: Start difference. First operand 2496 states and 4872 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:36,959 INFO L93 Difference]: Finished difference Result 6177 states and 12187 transitions. [2022-03-15 15:08:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:08:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:36,970 INFO L225 Difference]: With dead ends: 6177 [2022-03-15 15:08:36,971 INFO L226 Difference]: Without dead ends: 6177 [2022-03-15 15:08:36,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2022-03-15 15:08:36,972 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 977 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:36,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [977 Valid, 1401 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2022-03-15 15:08:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 2536. [2022-03-15 15:08:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-15 15:08:37,025 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-15 15:08:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:37,025 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-15 15:08:37,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-15 15:08:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:37,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:37,027 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:37,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:37,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 15:08:37,251 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1295126466, now seen corresponding path program 7 times [2022-03-15 15:08:37,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:37,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314361300] [2022-03-15 15:08:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:37,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:37,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314361300] [2022-03-15 15:08:37,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314361300] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:37,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374495343] [2022-03-15 15:08:37,389 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:37,392 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:37,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 15:08:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:37,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:37,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:37,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:37,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:37,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374495343] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:37,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:37,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:37,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247783562] [2022-03-15 15:08:37,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:37,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:37,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:37,874 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:38,810 INFO L93 Difference]: Finished difference Result 6219 states and 12247 transitions. [2022-03-15 15:08:38,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:08:38,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:38,822 INFO L225 Difference]: With dead ends: 6219 [2022-03-15 15:08:38,822 INFO L226 Difference]: Without dead ends: 6219 [2022-03-15 15:08:38,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=414, Invalid=1226, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:08:38,823 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 928 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:38,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 1487 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2022-03-15 15:08:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 2536. [2022-03-15 15:08:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2528 states have (on average 1.9588607594936709) internal successors, (4952), 2535 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4952 transitions. [2022-03-15 15:08:38,882 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4952 transitions. Word has length 105 [2022-03-15 15:08:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:38,882 INFO L470 AbstractCegarLoop]: Abstraction has 2536 states and 4952 transitions. [2022-03-15 15:08:38,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4952 transitions. [2022-03-15 15:08:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:38,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:38,886 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:38,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:39,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 15:08:39,110 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2095944408, now seen corresponding path program 8 times [2022-03-15 15:08:39,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:39,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035720468] [2022-03-15 15:08:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:39,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:39,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035720468] [2022-03-15 15:08:39,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035720468] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:39,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234453325] [2022-03-15 15:08:39,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:39,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:39,423 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 15:08:39,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:39,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:39,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:39,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:39,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:39,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:39,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234453325] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:39,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:39,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2022-03-15 15:08:39,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590885598] [2022-03-15 15:08:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:39,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:39,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2022-03-15 15:08:39,875 INFO L87 Difference]: Start difference. First operand 2536 states and 4952 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:40,317 INFO L93 Difference]: Finished difference Result 5867 states and 11581 transitions. [2022-03-15 15:08:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:40,327 INFO L225 Difference]: With dead ends: 5867 [2022-03-15 15:08:40,327 INFO L226 Difference]: Without dead ends: 5867 [2022-03-15 15:08:40,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-03-15 15:08:40,328 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 611 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:40,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1284 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2022-03-15 15:08:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 2554. [2022-03-15 15:08:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-15 15:08:40,380 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-15 15:08:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:40,381 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-15 15:08:40,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-15 15:08:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:40,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:40,383 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:40,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:40,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 15:08:40,604 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 552208584, now seen corresponding path program 9 times [2022-03-15 15:08:40,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:40,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545471611] [2022-03-15 15:08:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:40,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:40,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545471611] [2022-03-15 15:08:40,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545471611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:40,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137513350] [2022-03-15 15:08:40,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:40,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:40,852 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:40,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 15:08:40,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:40,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:40,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:41,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:41,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:41,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137513350] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:41,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:41,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:41,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139063744] [2022-03-15 15:08:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:41,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:41,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:41,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:41,371 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:42,235 INFO L93 Difference]: Finished difference Result 7170 states and 14149 transitions. [2022-03-15 15:08:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:08:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:42,243 INFO L225 Difference]: With dead ends: 7170 [2022-03-15 15:08:42,243 INFO L226 Difference]: Without dead ends: 7170 [2022-03-15 15:08:42,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:08:42,244 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 950 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:42,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 1459 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2022-03-15 15:08:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 2551. [2022-03-15 15:08:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-15 15:08:42,297 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-15 15:08:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:42,297 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-15 15:08:42,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-15 15:08:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:42,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:42,300 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:42,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:42,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:42,518 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:42,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1580365652, now seen corresponding path program 10 times [2022-03-15 15:08:42,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:42,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299183671] [2022-03-15 15:08:42,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:42,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:42,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:42,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299183671] [2022-03-15 15:08:42,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299183671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:42,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144822267] [2022-03-15 15:08:42,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:42,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:42,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:42,658 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:42,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 15:08:42,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:42,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:42,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:08:42,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:43,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:43,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:43,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144822267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:43,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:43,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-03-15 15:08:43,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030819904] [2022-03-15 15:08:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:43,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:08:43,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:08:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-03-15 15:08:43,068 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:43,921 INFO L93 Difference]: Finished difference Result 9974 states and 19724 transitions. [2022-03-15 15:08:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 15:08:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:43,935 INFO L225 Difference]: With dead ends: 9974 [2022-03-15 15:08:43,935 INFO L226 Difference]: Without dead ends: 9974 [2022-03-15 15:08:43,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 15:08:43,936 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 1228 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:43,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 1516 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:08:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-03-15 15:08:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2555. [2022-03-15 15:08:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-15 15:08:44,007 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-15 15:08:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:44,007 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-15 15:08:44,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-15 15:08:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:44,010 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:44,010 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:44,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:44,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:44,238 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2146609174, now seen corresponding path program 11 times [2022-03-15 15:08:44,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:44,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756121247] [2022-03-15 15:08:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:44,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:44,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756121247] [2022-03-15 15:08:44,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756121247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:44,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829374941] [2022-03-15 15:08:44,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:44,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:44,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:44,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 15:08:44,794 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:44,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:44,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:44,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:45,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:45,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:45,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829374941] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:45,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:45,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:45,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063827989] [2022-03-15 15:08:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:45,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:45,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:45,238 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:45,820 INFO L93 Difference]: Finished difference Result 7437 states and 14669 transitions. [2022-03-15 15:08:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:08:45,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:45,829 INFO L225 Difference]: With dead ends: 7437 [2022-03-15 15:08:45,829 INFO L226 Difference]: Without dead ends: 7437 [2022-03-15 15:08:45,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:08:45,830 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 817 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:45,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [817 Valid, 1580 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2022-03-15 15:08:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 2557. [2022-03-15 15:08:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-15 15:08:45,893 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-15 15:08:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:45,894 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-15 15:08:45,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-15 15:08:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:45,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:45,896 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:45,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:46,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:46,120 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:46,120 INFO L85 PathProgramCache]: Analyzing trace with hash -697555676, now seen corresponding path program 12 times [2022-03-15 15:08:46,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:46,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492481584] [2022-03-15 15:08:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:46,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:46,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492481584] [2022-03-15 15:08:46,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492481584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:46,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385156061] [2022-03-15 15:08:46,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:46,446 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:46,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 15:08:46,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:46,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:46,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:46,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:46,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:46,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:46,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385156061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:46,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:46,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:46,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332125963] [2022-03-15 15:08:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:46,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:46,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:46,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:46,923 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:47,848 INFO L93 Difference]: Finished difference Result 7479 states and 14729 transitions. [2022-03-15 15:08:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 15:08:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:47,859 INFO L225 Difference]: With dead ends: 7479 [2022-03-15 15:08:47,859 INFO L226 Difference]: Without dead ends: 7479 [2022-03-15 15:08:47,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1943, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 15:08:47,861 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 901 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:47,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 1597 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2022-03-15 15:08:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 2545. [2022-03-15 15:08:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2537 states have (on average 1.9590067008277494) internal successors, (4970), 2544 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4970 transitions. [2022-03-15 15:08:47,911 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4970 transitions. Word has length 105 [2022-03-15 15:08:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:47,912 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 4970 transitions. [2022-03-15 15:08:47,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4970 transitions. [2022-03-15 15:08:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:47,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:47,914 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:47,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:48,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:48,138 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 703468234, now seen corresponding path program 13 times [2022-03-15 15:08:48,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:48,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955282561] [2022-03-15 15:08:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:48,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:48,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:48,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955282561] [2022-03-15 15:08:48,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955282561] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:48,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076923925] [2022-03-15 15:08:48,502 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:48,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:48,503 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:48,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 15:08:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:48,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:48,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:49,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:49,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:49,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076923925] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:49,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:49,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:49,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739104818] [2022-03-15 15:08:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:49,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:49,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:49,109 INFO L87 Difference]: Start difference. First operand 2545 states and 4970 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:49,951 INFO L93 Difference]: Finished difference Result 7306 states and 14426 transitions. [2022-03-15 15:08:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:08:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:49,959 INFO L225 Difference]: With dead ends: 7306 [2022-03-15 15:08:49,959 INFO L226 Difference]: Without dead ends: 7306 [2022-03-15 15:08:49,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1855, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 15:08:49,960 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1189 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:49,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 1363 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-03-15 15:08:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 2555. [2022-03-15 15:08:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2547 states have (on average 1.9591676482135847) internal successors, (4990), 2554 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4990 transitions. [2022-03-15 15:08:49,995 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4990 transitions. Word has length 105 [2022-03-15 15:08:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:49,995 INFO L470 AbstractCegarLoop]: Abstraction has 2555 states and 4990 transitions. [2022-03-15 15:08:49,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4990 transitions. [2022-03-15 15:08:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:49,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:49,999 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:50,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:50,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:50,224 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 135475764, now seen corresponding path program 14 times [2022-03-15 15:08:50,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:50,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931898370] [2022-03-15 15:08:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:50,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:50,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931898370] [2022-03-15 15:08:50,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931898370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:50,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851247464] [2022-03-15 15:08:50,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:08:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:50,584 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:50,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 15:08:50,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:08:50,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:50,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:50,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:51,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:51,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:51,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851247464] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:51,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:51,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:51,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341669904] [2022-03-15 15:08:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:51,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:51,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:51,164 INFO L87 Difference]: Start difference. First operand 2555 states and 4990 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:51,723 INFO L93 Difference]: Finished difference Result 7627 states and 15035 transitions. [2022-03-15 15:08:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:08:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:51,736 INFO L225 Difference]: With dead ends: 7627 [2022-03-15 15:08:51,736 INFO L226 Difference]: Without dead ends: 7627 [2022-03-15 15:08:51,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:08:51,737 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 865 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:51,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1427 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-03-15 15:08:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 2557. [2022-03-15 15:08:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2549 states have (on average 1.959199686151432) internal successors, (4994), 2556 states have internal predecessors, (4994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4994 transitions. [2022-03-15 15:08:51,793 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4994 transitions. Word has length 105 [2022-03-15 15:08:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:51,794 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 4994 transitions. [2022-03-15 15:08:51,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4994 transitions. [2022-03-15 15:08:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:51,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:51,797 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:51,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:52,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:52,011 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1586278210, now seen corresponding path program 15 times [2022-03-15 15:08:52,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:52,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692656005] [2022-03-15 15:08:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:52,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:52,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692656005] [2022-03-15 15:08:52,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692656005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:52,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114594019] [2022-03-15 15:08:52,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:08:52,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:52,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:52,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 15:08:52,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:08:52,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:52,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:52,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:52,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:52,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:52,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114594019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:52,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:52,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:52,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976703845] [2022-03-15 15:08:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:52,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:52,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:52,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:52,902 INFO L87 Difference]: Start difference. First operand 2557 states and 4994 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:53,795 INFO L93 Difference]: Finished difference Result 7669 states and 15095 transitions. [2022-03-15 15:08:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 15:08:53,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:53,806 INFO L225 Difference]: With dead ends: 7669 [2022-03-15 15:08:53,806 INFO L226 Difference]: Without dead ends: 7669 [2022-03-15 15:08:53,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 15:08:53,807 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 986 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:53,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [986 Valid, 1501 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2022-03-15 15:08:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 2551. [2022-03-15 15:08:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2543 states have (on average 1.959103421156115) internal successors, (4982), 2550 states have internal predecessors, (4982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4982 transitions. [2022-03-15 15:08:53,849 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4982 transitions. Word has length 105 [2022-03-15 15:08:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:53,849 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 4982 transitions. [2022-03-15 15:08:53,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4982 transitions. [2022-03-15 15:08:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:53,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:53,851 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:53,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-15 15:08:54,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 15:08:54,052 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -27754878, now seen corresponding path program 16 times [2022-03-15 15:08:54,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:54,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528082537] [2022-03-15 15:08:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:54,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:54,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528082537] [2022-03-15 15:08:54,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528082537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:54,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618963780] [2022-03-15 15:08:54,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:08:54,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:54,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:54,183 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:54,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 15:08:54,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:08:54,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:54,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 15:08:54,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:54,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:54,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:08:54,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:08:54,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:08:54,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:08:54,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:08:55,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:08:55,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 15:08:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:55,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:55,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618963780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:55,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:55,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2022-03-15 15:08:55,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291002119] [2022-03-15 15:08:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:55,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 15:08:55,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 15:08:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-03-15 15:08:55,044 INFO L87 Difference]: Start difference. First operand 2551 states and 4982 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:55,753 INFO L93 Difference]: Finished difference Result 6873 states and 13572 transitions. [2022-03-15 15:08:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:08:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:55,761 INFO L225 Difference]: With dead ends: 6873 [2022-03-15 15:08:55,761 INFO L226 Difference]: Without dead ends: 6873 [2022-03-15 15:08:55,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:08:55,762 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 744 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:55,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [744 Valid, 1284 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:08:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6873 states. [2022-03-15 15:08:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6873 to 2556. [2022-03-15 15:08:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2548 states have (on average 1.9591836734693877) internal successors, (4992), 2555 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4992 transitions. [2022-03-15 15:08:55,813 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4992 transitions. Word has length 105 [2022-03-15 15:08:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:55,813 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 4992 transitions. [2022-03-15 15:08:55,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4992 transitions. [2022-03-15 15:08:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:55,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:55,815 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:55,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 15:08:56,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 15:08:56,029 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 782515202, now seen corresponding path program 17 times [2022-03-15 15:08:56,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:56,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873658064] [2022-03-15 15:08:56,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:56,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:56,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:56,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873658064] [2022-03-15 15:08:56,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873658064] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:56,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800715368] [2022-03-15 15:08:56,234 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:08:56,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:56,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:56,236 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:56,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 15:08:56,415 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:08:56,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:56,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:56,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:56,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:56,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:56,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800715368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:56,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:56,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:08:56,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995559954] [2022-03-15 15:08:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:56,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:56,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:08:56,720 INFO L87 Difference]: Start difference. First operand 2556 states and 4992 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:57,560 INFO L93 Difference]: Finished difference Result 7089 states and 13973 transitions. [2022-03-15 15:08:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 15:08:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:57,567 INFO L225 Difference]: With dead ends: 7089 [2022-03-15 15:08:57,567 INFO L226 Difference]: Without dead ends: 7089 [2022-03-15 15:08:57,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 15:08:57,568 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 1073 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:57,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 1406 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:08:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-15 15:08:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2554. [2022-03-15 15:08:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2546 states have (on average 1.9591516103692066) internal successors, (4988), 2553 states have internal predecessors, (4988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4988 transitions. [2022-03-15 15:08:57,604 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4988 transitions. Word has length 105 [2022-03-15 15:08:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:57,604 INFO L470 AbstractCegarLoop]: Abstraction has 2554 states and 4988 transitions. [2022-03-15 15:08:57,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4988 transitions. [2022-03-15 15:08:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:57,605 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:57,606 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:57,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 15:08:57,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 15:08:57,806 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash -612674444, now seen corresponding path program 18 times [2022-03-15 15:08:57,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:57,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366275700] [2022-03-15 15:08:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:58,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:58,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366275700] [2022-03-15 15:08:58,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366275700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:58,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275480937] [2022-03-15 15:08:58,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:08:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:58,128 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:58,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 15:08:58,269 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:08:58,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:08:58,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:58,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:58,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:58,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:58,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275480937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:58,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:58,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:08:58,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121712462] [2022-03-15 15:08:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:58,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:58,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:08:58,628 INFO L87 Difference]: Start difference. First operand 2554 states and 4988 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:08:58,918 INFO L93 Difference]: Finished difference Result 4622 states and 9091 transitions. [2022-03-15 15:08:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:08:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:08:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:08:58,923 INFO L225 Difference]: With dead ends: 4622 [2022-03-15 15:08:58,923 INFO L226 Difference]: Without dead ends: 4622 [2022-03-15 15:08:58,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:08:58,923 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 458 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:08:58,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 1027 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:08:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2022-03-15 15:08:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2611. [2022-03-15 15:08:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2603 states have (on average 1.9600461006530925) internal successors, (5102), 2610 states have internal predecessors, (5102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 5102 transitions. [2022-03-15 15:08:58,951 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 5102 transitions. Word has length 105 [2022-03-15 15:08:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:08:58,951 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 5102 transitions. [2022-03-15 15:08:58,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:08:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 5102 transitions. [2022-03-15 15:08:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:08:58,953 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:08:58,953 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:08:58,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 15:08:59,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:59,153 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:08:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:08:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash -830929600, now seen corresponding path program 19 times [2022-03-15 15:08:59,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:08:59,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691085303] [2022-03-15 15:08:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:08:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:08:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:08:59,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:08:59,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691085303] [2022-03-15 15:08:59,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691085303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:08:59,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816180359] [2022-03-15 15:08:59,277 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:08:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:08:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:08:59,278 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:08:59,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 15:08:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:08:59,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:08:59,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:08:59,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:08:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:08:59,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:08:59,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816180359] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:08:59,703 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:08:59,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:08:59,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486287345] [2022-03-15 15:08:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:08:59,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:08:59,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:08:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:08:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:08:59,704 INFO L87 Difference]: Start difference. First operand 2611 states and 5102 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:00,043 INFO L93 Difference]: Finished difference Result 5142 states and 10145 transitions. [2022-03-15 15:09:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:00,049 INFO L225 Difference]: With dead ends: 5142 [2022-03-15 15:09:00,049 INFO L226 Difference]: Without dead ends: 5142 [2022-03-15 15:09:00,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:09:00,049 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 559 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:00,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 1280 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2022-03-15 15:09:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 2626. [2022-03-15 15:09:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-15 15:09:00,083 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-15 15:09:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:00,083 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-15 15:09:00,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-15 15:09:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:00,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:00,085 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:00,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 15:09:00,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 15:09:00,286 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1817223392, now seen corresponding path program 20 times [2022-03-15 15:09:00,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:00,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269768819] [2022-03-15 15:09:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:00,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:00,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269768819] [2022-03-15 15:09:00,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269768819] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:00,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783258146] [2022-03-15 15:09:00,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:00,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:00,616 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:00,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 15:09:00,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:00,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:00,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:01,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:01,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:01,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783258146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:01,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:01,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:01,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48137861] [2022-03-15 15:09:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:01,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:01,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:01,127 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:01,914 INFO L93 Difference]: Finished difference Result 6445 states and 12713 transitions. [2022-03-15 15:09:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:09:01,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:01,920 INFO L225 Difference]: With dead ends: 6445 [2022-03-15 15:09:01,920 INFO L226 Difference]: Without dead ends: 6445 [2022-03-15 15:09:01,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:01,921 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 959 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:01,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 1302 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-03-15 15:09:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 2623. [2022-03-15 15:09:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-15 15:09:01,961 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-15 15:09:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:01,961 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-15 15:09:01,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-15 15:09:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:01,963 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:01,963 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:01,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-03-15 15:09:02,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 15:09:02,164 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:02,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash -315350844, now seen corresponding path program 21 times [2022-03-15 15:09:02,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:02,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841815268] [2022-03-15 15:09:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:02,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:02,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841815268] [2022-03-15 15:09:02,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841815268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:02,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925516833] [2022-03-15 15:09:02,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:02,516 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:02,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 15:09:02,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:02,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:02,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:02,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:02,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:03,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:03,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925516833] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:03,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:03,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:03,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060529857] [2022-03-15 15:09:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:03,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:03,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:03,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:03,038 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:03,947 INFO L93 Difference]: Finished difference Result 8268 states and 16326 transitions. [2022-03-15 15:09:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:09:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:03,956 INFO L225 Difference]: With dead ends: 8268 [2022-03-15 15:09:03,956 INFO L226 Difference]: Without dead ends: 8268 [2022-03-15 15:09:03,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 15:09:03,957 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 1119 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:03,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1119 Valid, 1704 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2022-03-15 15:09:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 2627. [2022-03-15 15:09:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-15 15:09:03,998 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-15 15:09:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:03,998 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-15 15:09:03,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-15 15:09:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:04,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:04,000 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:04,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:04,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:04,218 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash -883343314, now seen corresponding path program 22 times [2022-03-15 15:09:04,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:04,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335885794] [2022-03-15 15:09:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:04,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:04,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:04,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335885794] [2022-03-15 15:09:04,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335885794] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:04,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959413847] [2022-03-15 15:09:04,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:04,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:04,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:04,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 15:09:04,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:04,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:04,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 15:09:04,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:05,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:05,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:05,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959413847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:05,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:05,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2022-03-15 15:09:05,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702758569] [2022-03-15 15:09:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:05,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 15:09:05,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 15:09:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:05,119 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:05,754 INFO L93 Difference]: Finished difference Result 7769 states and 15347 transitions. [2022-03-15 15:09:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 15:09:05,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:05,762 INFO L225 Difference]: With dead ends: 7769 [2022-03-15 15:09:05,763 INFO L226 Difference]: Without dead ends: 7769 [2022-03-15 15:09:05,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:09:05,763 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 991 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:05,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [991 Valid, 1449 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7769 states. [2022-03-15 15:09:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7769 to 2629. [2022-03-15 15:09:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-15 15:09:05,819 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-15 15:09:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:05,819 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-15 15:09:05,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-15 15:09:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:05,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:05,820 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:05,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 15:09:06,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:06,027 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 567459132, now seen corresponding path program 23 times [2022-03-15 15:09:06,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:06,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644842829] [2022-03-15 15:09:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:06,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:06,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644842829] [2022-03-15 15:09:06,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644842829] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:06,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865395230] [2022-03-15 15:09:06,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:06,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:06,356 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:06,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 15:09:06,564 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:06,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:06,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:06,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:06,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:06,916 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:06,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:06,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865395230] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:06,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:06,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:06,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535603971] [2022-03-15 15:09:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:06,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:06,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:06,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:06,918 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:07,765 INFO L93 Difference]: Finished difference Result 6754 states and 13293 transitions. [2022-03-15 15:09:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:09:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:07,772 INFO L225 Difference]: With dead ends: 6754 [2022-03-15 15:09:07,772 INFO L226 Difference]: Without dead ends: 6754 [2022-03-15 15:09:07,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:07,773 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 881 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:07,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 1694 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2022-03-15 15:09:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 2617. [2022-03-15 15:09:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-15 15:09:07,806 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-15 15:09:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:07,806 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-15 15:09:07,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-15 15:09:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:07,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:07,807 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:07,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 15:09:08,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:08,008 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:08,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1968483042, now seen corresponding path program 24 times [2022-03-15 15:09:08,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:08,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855621579] [2022-03-15 15:09:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:08,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:08,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855621579] [2022-03-15 15:09:08,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855621579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:08,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347553632] [2022-03-15 15:09:08,202 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:08,204 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:08,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 15:09:08,403 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:08,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:08,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:08,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:08,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:08,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:08,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347553632] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:08,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:08,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:08,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976948839] [2022-03-15 15:09:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:08,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:08,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:08,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:08,710 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:09,617 INFO L93 Difference]: Finished difference Result 7944 states and 15678 transitions. [2022-03-15 15:09:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 15:09:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:09,626 INFO L225 Difference]: With dead ends: 7944 [2022-03-15 15:09:09,627 INFO L226 Difference]: Without dead ends: 7944 [2022-03-15 15:09:09,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 15:09:09,628 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 1151 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:09,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 1638 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-03-15 15:09:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 2627. [2022-03-15 15:09:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2619 states have (on average 1.9602901870943108) internal successors, (5134), 2626 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 5134 transitions. [2022-03-15 15:09:09,674 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 5134 transitions. Word has length 105 [2022-03-15 15:09:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:09,674 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 5134 transitions. [2022-03-15 15:09:09,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 5134 transitions. [2022-03-15 15:09:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:09,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:09,675 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:09,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 15:09:09,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:09,876 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1400490572, now seen corresponding path program 25 times [2022-03-15 15:09:09,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:09,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316384988] [2022-03-15 15:09:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:10,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:10,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316384988] [2022-03-15 15:09:10,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316384988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:10,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110257039] [2022-03-15 15:09:10,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:10,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:10,069 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 15:09:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:10,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:10,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:10,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:10,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:10,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110257039] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:10,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:10,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:10,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784500811] [2022-03-15 15:09:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:10,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:10,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:10,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:10,546 INFO L87 Difference]: Start difference. First operand 2627 states and 5134 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:11,074 INFO L93 Difference]: Finished difference Result 8265 states and 16287 transitions. [2022-03-15 15:09:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 15:09:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:11,083 INFO L225 Difference]: With dead ends: 8265 [2022-03-15 15:09:11,083 INFO L226 Difference]: Without dead ends: 8265 [2022-03-15 15:09:11,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:09:11,084 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 886 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:11,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 1651 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2022-03-15 15:09:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 2629. [2022-03-15 15:09:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2621 states have (on average 1.9603204883632201) internal successors, (5138), 2628 states have internal predecessors, (5138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 5138 transitions. [2022-03-15 15:09:11,127 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 5138 transitions. Word has length 105 [2022-03-15 15:09:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:11,127 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 5138 transitions. [2022-03-15 15:09:11,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 5138 transitions. [2022-03-15 15:09:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:11,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:11,128 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:11,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 15:09:11,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 15:09:11,329 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1443674278, now seen corresponding path program 26 times [2022-03-15 15:09:11,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:11,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761277802] [2022-03-15 15:09:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:11,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:11,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761277802] [2022-03-15 15:09:11,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761277802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:11,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889776404] [2022-03-15 15:09:11,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:11,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:11,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:11,524 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:11,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 15:09:11,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:11,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:11,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:11,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:12,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:12,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:12,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889776404] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:12,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:12,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:12,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717825083] [2022-03-15 15:09:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:12,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:12,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:12,084 INFO L87 Difference]: Start difference. First operand 2629 states and 5138 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:12,975 INFO L93 Difference]: Finished difference Result 8307 states and 16347 transitions. [2022-03-15 15:09:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:09:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:12,985 INFO L225 Difference]: With dead ends: 8307 [2022-03-15 15:09:12,985 INFO L226 Difference]: Without dead ends: 8307 [2022-03-15 15:09:12,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 15:09:12,986 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 954 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:12,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 1698 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8307 states. [2022-03-15 15:09:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8307 to 2623. [2022-03-15 15:09:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2615 states have (on average 1.9602294455066922) internal successors, (5126), 2622 states have internal predecessors, (5126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 5126 transitions. [2022-03-15 15:09:13,036 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 5126 transitions. Word has length 105 [2022-03-15 15:09:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:13,037 INFO L470 AbstractCegarLoop]: Abstraction has 2623 states and 5126 transitions. [2022-03-15 15:09:13,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 5126 transitions. [2022-03-15 15:09:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:13,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:13,038 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:13,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 15:09:13,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:13,239 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1237259930, now seen corresponding path program 27 times [2022-03-15 15:09:13,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:13,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636013436] [2022-03-15 15:09:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:13,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:13,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636013436] [2022-03-15 15:09:13,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636013436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:13,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352332730] [2022-03-15 15:09:13,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:13,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:13,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:13,355 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:13,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 15:09:13,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:13,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:13,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:13,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:13,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:13,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:13,898 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352332730] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:13,898 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:13,898 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:13,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267075850] [2022-03-15 15:09:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:13,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:13,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:13,899 INFO L87 Difference]: Start difference. First operand 2623 states and 5126 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:14,447 INFO L93 Difference]: Finished difference Result 7504 states and 14817 transitions. [2022-03-15 15:09:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 15:09:14,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:14,454 INFO L225 Difference]: With dead ends: 7504 [2022-03-15 15:09:14,454 INFO L226 Difference]: Without dead ends: 7504 [2022-03-15 15:09:14,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-03-15 15:09:14,459 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 748 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:14,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 1535 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2022-03-15 15:09:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 2628. [2022-03-15 15:09:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2620 states have (on average 1.9603053435114504) internal successors, (5136), 2627 states have internal predecessors, (5136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5136 transitions. [2022-03-15 15:09:14,496 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5136 transitions. Word has length 105 [2022-03-15 15:09:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:14,496 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 5136 transitions. [2022-03-15 15:09:14,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5136 transitions. [2022-03-15 15:09:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:14,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:14,498 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:14,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 15:09:14,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:14,713 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:14,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2047530010, now seen corresponding path program 28 times [2022-03-15 15:09:14,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:14,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17261436] [2022-03-15 15:09:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:14,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:14,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17261436] [2022-03-15 15:09:14,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17261436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:14,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356011515] [2022-03-15 15:09:14,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:14,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:14,914 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:14,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 15:09:15,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:15,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:15,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 15:09:15,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:15,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:15,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:15,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:15,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:15,789 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 15:09:15,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 15:09:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:15,889 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:09:15,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:09:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:15,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:15,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356011515] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:15,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:15,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2022-03-15 15:09:15,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943966098] [2022-03-15 15:09:15,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:15,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 15:09:15,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:15,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 15:09:15,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-03-15 15:09:15,925 INFO L87 Difference]: Start difference. First operand 2628 states and 5136 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:17,950 INFO L93 Difference]: Finished difference Result 7649 states and 15107 transitions. [2022-03-15 15:09:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 15:09:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:17,958 INFO L225 Difference]: With dead ends: 7649 [2022-03-15 15:09:17,958 INFO L226 Difference]: Without dead ends: 7649 [2022-03-15 15:09:17,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=556, Invalid=2200, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 15:09:17,960 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 966 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:17,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 2044 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 15:09:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2022-03-15 15:09:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 2648. [2022-03-15 15:09:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2648 states, 2640 states have (on average 1.9606060606060607) internal successors, (5176), 2647 states have internal predecessors, (5176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 5176 transitions. [2022-03-15 15:09:17,998 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 5176 transitions. Word has length 105 [2022-03-15 15:09:17,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:17,998 INFO L470 AbstractCegarLoop]: Abstraction has 2648 states and 5176 transitions. [2022-03-15 15:09:17,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 5176 transitions. [2022-03-15 15:09:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:18,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:18,000 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:18,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:18,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 15:09:18,200 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1665619056, now seen corresponding path program 29 times [2022-03-15 15:09:18,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:18,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76871604] [2022-03-15 15:09:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:18,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:18,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76871604] [2022-03-15 15:09:18,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76871604] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:18,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261417583] [2022-03-15 15:09:18,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:18,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:18,518 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:18,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 15:09:18,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:18,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:18,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:18,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:19,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:19,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:19,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261417583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:19,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:19,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:19,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017236403] [2022-03-15 15:09:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:19,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:19,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:19,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:19,147 INFO L87 Difference]: Start difference. First operand 2648 states and 5176 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:20,089 INFO L93 Difference]: Finished difference Result 7727 states and 15225 transitions. [2022-03-15 15:09:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 15:09:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:20,098 INFO L225 Difference]: With dead ends: 7727 [2022-03-15 15:09:20,098 INFO L226 Difference]: Without dead ends: 7727 [2022-03-15 15:09:20,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:09:20,099 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 1070 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:20,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1070 Valid, 1538 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 15:09:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2022-03-15 15:09:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 2626. [2022-03-15 15:09:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2618 states have (on average 1.9602750190985485) internal successors, (5132), 2625 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 5132 transitions. [2022-03-15 15:09:20,141 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 5132 transitions. Word has length 105 [2022-03-15 15:09:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:20,141 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 5132 transitions. [2022-03-15 15:09:20,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 5132 transitions. [2022-03-15 15:09:20,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:20,143 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:20,143 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:20,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 15:09:20,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 15:09:20,343 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash 652340364, now seen corresponding path program 30 times [2022-03-15 15:09:20,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:20,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339222666] [2022-03-15 15:09:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:20,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:20,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339222666] [2022-03-15 15:09:20,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339222666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:20,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023326426] [2022-03-15 15:09:20,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:20,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:20,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:20,692 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:20,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 15:09:20,949 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:20,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:20,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:20,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:21,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:21,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:21,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023326426] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:21,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:21,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:21,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892042044] [2022-03-15 15:09:21,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:21,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:21,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:21,289 INFO L87 Difference]: Start difference. First operand 2626 states and 5132 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:21,636 INFO L93 Difference]: Finished difference Result 5260 states and 10343 transitions. [2022-03-15 15:09:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:21,641 INFO L225 Difference]: With dead ends: 5260 [2022-03-15 15:09:21,641 INFO L226 Difference]: Without dead ends: 5260 [2022-03-15 15:09:21,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:09:21,642 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 452 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:21,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 1387 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2022-03-15 15:09:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 2608. [2022-03-15 15:09:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-15 15:09:21,672 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-15 15:09:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:21,673 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-15 15:09:21,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-15 15:09:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:21,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:21,675 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:21,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-03-15 15:09:21,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 15:09:21,891 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 564648876, now seen corresponding path program 31 times [2022-03-15 15:09:21,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:21,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123734319] [2022-03-15 15:09:21,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:21,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:22,239 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:22,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:22,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123734319] [2022-03-15 15:09:22,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123734319] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:22,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031291302] [2022-03-15 15:09:22,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:22,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:22,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:22,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:22,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 15:09:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:22,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:22,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:22,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:22,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:22,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031291302] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:22,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:22,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:22,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155077097] [2022-03-15 15:09:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:22,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:22,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:22,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:22,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:22,851 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:23,863 INFO L93 Difference]: Finished difference Result 6726 states and 13266 transitions. [2022-03-15 15:09:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:23,872 INFO L225 Difference]: With dead ends: 6726 [2022-03-15 15:09:23,872 INFO L226 Difference]: Without dead ends: 6726 [2022-03-15 15:09:23,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=2169, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 15:09:23,873 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 1246 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:23,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1594 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2022-03-15 15:09:23,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 2616. [2022-03-15 15:09:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2616 states, 2608 states have (on average 1.960122699386503) internal successors, (5112), 2615 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 5112 transitions. [2022-03-15 15:09:23,922 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 5112 transitions. Word has length 105 [2022-03-15 15:09:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:23,922 INFO L470 AbstractCegarLoop]: Abstraction has 2616 states and 5112 transitions. [2022-03-15 15:09:23,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 5112 transitions. [2022-03-15 15:09:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:23,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:23,924 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:23,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:24,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 15:09:24,139 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash -3343594, now seen corresponding path program 32 times [2022-03-15 15:09:24,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:24,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698966628] [2022-03-15 15:09:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:24,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:24,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:24,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698966628] [2022-03-15 15:09:24,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698966628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:24,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417847942] [2022-03-15 15:09:24,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:24,311 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:24,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 15:09:24,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:24,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:24,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:24,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:24,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:24,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:24,808 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417847942] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:24,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:24,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:24,808 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288259369] [2022-03-15 15:09:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:24,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:24,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:24,809 INFO L87 Difference]: Start difference. First operand 2616 states and 5112 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:25,369 INFO L93 Difference]: Finished difference Result 7047 states and 13875 transitions. [2022-03-15 15:09:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:09:25,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:25,377 INFO L225 Difference]: With dead ends: 7047 [2022-03-15 15:09:25,378 INFO L226 Difference]: Without dead ends: 7047 [2022-03-15 15:09:25,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:09:25,378 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 940 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:25,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 1574 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-03-15 15:09:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 2618. [2022-03-15 15:09:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2610 states have (on average 1.9601532567049809) internal successors, (5116), 2617 states have internal predecessors, (5116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 5116 transitions. [2022-03-15 15:09:25,416 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 5116 transitions. Word has length 105 [2022-03-15 15:09:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:25,417 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 5116 transitions. [2022-03-15 15:09:25,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 5116 transitions. [2022-03-15 15:09:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:25,418 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:25,418 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:25,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:25,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:25,619 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1447458852, now seen corresponding path program 33 times [2022-03-15 15:09:25,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:25,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393790746] [2022-03-15 15:09:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:25,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:25,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393790746] [2022-03-15 15:09:25,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393790746] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:25,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868970238] [2022-03-15 15:09:25,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:25,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:25,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:25,918 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:25,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 15:09:26,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:26,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:26,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:26,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:26,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:26,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:26,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868970238] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:26,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:26,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:26,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926109110] [2022-03-15 15:09:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:26,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:26,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:26,480 INFO L87 Difference]: Start difference. First operand 2618 states and 5116 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:27,447 INFO L93 Difference]: Finished difference Result 7089 states and 13935 transitions. [2022-03-15 15:09:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:27,455 INFO L225 Difference]: With dead ends: 7089 [2022-03-15 15:09:27,455 INFO L226 Difference]: Without dead ends: 7089 [2022-03-15 15:09:27,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 15:09:27,456 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1032 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:27,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1032 Valid, 1643 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2022-03-15 15:09:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 2612. [2022-03-15 15:09:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2612 states, 2604 states have (on average 1.9600614439324118) internal successors, (5104), 2611 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 5104 transitions. [2022-03-15 15:09:27,495 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 5104 transitions. Word has length 105 [2022-03-15 15:09:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:27,496 INFO L470 AbstractCegarLoop]: Abstraction has 2612 states and 5104 transitions. [2022-03-15 15:09:27,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 5104 transitions. [2022-03-15 15:09:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:27,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:27,497 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:27,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:27,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 15:09:27,711 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash -166574236, now seen corresponding path program 34 times [2022-03-15 15:09:27,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:27,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838755802] [2022-03-15 15:09:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:28,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:28,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838755802] [2022-03-15 15:09:28,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838755802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:28,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640783164] [2022-03-15 15:09:28,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:28,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:28,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:28,070 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:28,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 15:09:28,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:28,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:28,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 15:09:28,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:28,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:28,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:28,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:28,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:28,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:28,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:28,975 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-15 15:09:28,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-03-15 15:09:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:29,074 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:09:29,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2022-03-15 15:09:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:29,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:29,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640783164] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:29,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:29,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [18] total 32 [2022-03-15 15:09:29,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792959609] [2022-03-15 15:09:29,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:29,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 15:09:29,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 15:09:29,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-03-15 15:09:29,121 INFO L87 Difference]: Start difference. First operand 2612 states and 5104 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:30,757 INFO L93 Difference]: Finished difference Result 8798 states and 17396 transitions. [2022-03-15 15:09:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 15:09:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:30,767 INFO L225 Difference]: With dead ends: 8798 [2022-03-15 15:09:30,767 INFO L226 Difference]: Without dead ends: 8798 [2022-03-15 15:09:30,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=475, Invalid=2605, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 15:09:30,768 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 1053 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:30,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1053 Valid, 2125 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 15:09:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2022-03-15 15:09:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 2658. [2022-03-15 15:09:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2650 states have (on average 1.9607547169811321) internal successors, (5196), 2657 states have internal predecessors, (5196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 5196 transitions. [2022-03-15 15:09:30,829 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 5196 transitions. Word has length 105 [2022-03-15 15:09:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:30,830 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 5196 transitions. [2022-03-15 15:09:30,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 16 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 5196 transitions. [2022-03-15 15:09:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:30,831 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:30,831 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:31,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 15:09:31,032 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash 415243994, now seen corresponding path program 35 times [2022-03-15 15:09:31,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:31,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561289229] [2022-03-15 15:09:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:31,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:31,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561289229] [2022-03-15 15:09:31,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561289229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:31,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64893593] [2022-03-15 15:09:31,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:31,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:31,341 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:31,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 15:09:31,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:31,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:31,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:31,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:31,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:31,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:31,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64893593] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:31,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:31,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2022-03-15 15:09:31,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792448461] [2022-03-15 15:09:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:31,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:31,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:31,922 INFO L87 Difference]: Start difference. First operand 2658 states and 5196 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:32,546 INFO L93 Difference]: Finished difference Result 7844 states and 15465 transitions. [2022-03-15 15:09:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:09:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:32,554 INFO L225 Difference]: With dead ends: 7844 [2022-03-15 15:09:32,554 INFO L226 Difference]: Without dead ends: 7844 [2022-03-15 15:09:32,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 15:09:32,554 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 840 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:32,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 1569 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2022-03-15 15:09:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 2617. [2022-03-15 15:09:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2617 states, 2609 states have (on average 1.9601379839018782) internal successors, (5114), 2616 states have internal predecessors, (5114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 5114 transitions. [2022-03-15 15:09:32,593 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 5114 transitions. Word has length 105 [2022-03-15 15:09:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:32,593 INFO L470 AbstractCegarLoop]: Abstraction has 2617 states and 5114 transitions. [2022-03-15 15:09:32,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 5114 transitions. [2022-03-15 15:09:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:32,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:32,595 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:32,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 15:09:32,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 15:09:32,795 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash 643695844, now seen corresponding path program 36 times [2022-03-15 15:09:32,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:32,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615008879] [2022-03-15 15:09:32,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:32,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:32,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615008879] [2022-03-15 15:09:32,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615008879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:32,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399949695] [2022-03-15 15:09:32,909 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:09:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:32,912 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:32,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 15:09:33,142 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 15:09:33,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:33,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:33,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:33,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:33,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:33,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399949695] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:33,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:33,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:33,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486083132] [2022-03-15 15:09:33,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:33,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:33,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:33,448 INFO L87 Difference]: Start difference. First operand 2617 states and 5114 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:34,331 INFO L93 Difference]: Finished difference Result 8063 states and 15869 transitions. [2022-03-15 15:09:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:09:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:34,340 INFO L225 Difference]: With dead ends: 8063 [2022-03-15 15:09:34,341 INFO L226 Difference]: Without dead ends: 8063 [2022-03-15 15:09:34,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1187, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 15:09:34,342 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 1196 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:34,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 1497 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8063 states. [2022-03-15 15:09:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8063 to 2615. [2022-03-15 15:09:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2615 states, 2607 states have (on average 1.9601074031453778) internal successors, (5110), 2614 states have internal predecessors, (5110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 5110 transitions. [2022-03-15 15:09:34,384 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 5110 transitions. Word has length 105 [2022-03-15 15:09:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:34,384 INFO L470 AbstractCegarLoop]: Abstraction has 2615 states and 5110 transitions. [2022-03-15 15:09:34,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 5110 transitions. [2022-03-15 15:09:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:34,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:34,385 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:34,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 15:09:34,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:34,586 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -751493802, now seen corresponding path program 37 times [2022-03-15 15:09:34,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:34,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35363160] [2022-03-15 15:09:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:34,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:34,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35363160] [2022-03-15 15:09:34,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35363160] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:34,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833866508] [2022-03-15 15:09:34,706 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 15:09:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:34,708 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:34,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 15:09:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:34,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:34,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:35,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:35,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:35,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833866508] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:35,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:35,253 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:35,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262640640] [2022-03-15 15:09:35,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:35,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:35,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:35,254 INFO L87 Difference]: Start difference. First operand 2615 states and 5110 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:35,586 INFO L93 Difference]: Finished difference Result 5596 states and 10987 transitions. [2022-03-15 15:09:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 15:09:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:35,591 INFO L225 Difference]: With dead ends: 5596 [2022-03-15 15:09:35,591 INFO L226 Difference]: Without dead ends: 5596 [2022-03-15 15:09:35,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-03-15 15:09:35,592 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 562 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:35,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1354 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2022-03-15 15:09:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 2606. [2022-03-15 15:09:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2598 states have (on average 1.959969207082371) internal successors, (5092), 2605 states have internal predecessors, (5092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 5092 transitions. [2022-03-15 15:09:35,630 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 5092 transitions. Word has length 105 [2022-03-15 15:09:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:35,630 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 5092 transitions. [2022-03-15 15:09:35,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 5092 transitions. [2022-03-15 15:09:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:35,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:35,632 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:35,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:35,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:35,856 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1780597932, now seen corresponding path program 38 times [2022-03-15 15:09:35,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:35,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158076492] [2022-03-15 15:09:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:36,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:36,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158076492] [2022-03-15 15:09:36,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158076492] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:36,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974495251] [2022-03-15 15:09:36,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:36,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:36,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:36,041 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:36,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 15:09:36,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 15:09:36,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:36,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:36,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:36,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:36,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:36,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974495251] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:36,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:36,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:36,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512901312] [2022-03-15 15:09:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:36,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:36,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:36,571 INFO L87 Difference]: Start difference. First operand 2606 states and 5092 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:37,119 INFO L93 Difference]: Finished difference Result 6301 states and 12435 transitions. [2022-03-15 15:09:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 15:09:37,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:37,126 INFO L225 Difference]: With dead ends: 6301 [2022-03-15 15:09:37,126 INFO L226 Difference]: Without dead ends: 6301 [2022-03-15 15:09:37,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 15:09:37,127 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 822 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:37,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 1425 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-03-15 15:09:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 2610. [2022-03-15 15:09:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2602 states have (on average 1.9600307455803228) internal successors, (5100), 2609 states have internal predecessors, (5100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 5100 transitions. [2022-03-15 15:09:37,160 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 5100 transitions. Word has length 105 [2022-03-15 15:09:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:37,160 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 5100 transitions. [2022-03-15 15:09:37,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 5100 transitions. [2022-03-15 15:09:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:37,161 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:37,162 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:37,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 15:09:37,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 15:09:37,362 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1704099284, now seen corresponding path program 39 times [2022-03-15 15:09:37,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:37,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755692643] [2022-03-15 15:09:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:37,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:37,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755692643] [2022-03-15 15:09:37,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755692643] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:37,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210317541] [2022-03-15 15:09:37,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:09:37,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:37,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:37,463 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:37,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 15:09:37,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 15:09:37,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:37,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:37,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:37,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:38,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:38,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210317541] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:38,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:38,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2022-03-15 15:09:38,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899573768] [2022-03-15 15:09:38,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:38,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:38,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-03-15 15:09:38,020 INFO L87 Difference]: Start difference. First operand 2610 states and 5100 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:38,902 INFO L93 Difference]: Finished difference Result 6524 states and 12843 transitions. [2022-03-15 15:09:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 15:09:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:38,909 INFO L225 Difference]: With dead ends: 6524 [2022-03-15 15:09:38,909 INFO L226 Difference]: Without dead ends: 6524 [2022-03-15 15:09:38,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:09:38,910 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 1253 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:38,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1253 Valid, 1386 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 15:09:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2022-03-15 15:09:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 2608. [2022-03-15 15:09:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2600 states have (on average 1.96) internal successors, (5096), 2607 states have internal predecessors, (5096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5096 transitions. [2022-03-15 15:09:38,945 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5096 transitions. Word has length 105 [2022-03-15 15:09:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:38,945 INFO L470 AbstractCegarLoop]: Abstraction has 2608 states and 5096 transitions. [2022-03-15 15:09:38,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5096 transitions. [2022-03-15 15:09:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:38,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:38,946 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:38,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 15:09:39,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 15:09:39,147 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1195678366, now seen corresponding path program 40 times [2022-03-15 15:09:39,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:39,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366819897] [2022-03-15 15:09:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:39,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:39,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366819897] [2022-03-15 15:09:39,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366819897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:39,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489687548] [2022-03-15 15:09:39,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:09:39,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:39,357 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:39,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 15:09:39,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:09:39,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:39,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 15:09:39,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:39,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:39,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:39,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:39,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:40,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:40,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:40,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:40,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-03-15 15:09:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:40,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:40,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489687548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:40,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:40,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 15 [2022-03-15 15:09:40,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831586941] [2022-03-15 15:09:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:40,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 15:09:40,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 15:09:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 15:09:40,114 INFO L87 Difference]: Start difference. First operand 2608 states and 5096 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:40,777 INFO L93 Difference]: Finished difference Result 5379 states and 10546 transitions. [2022-03-15 15:09:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 15:09:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:40,782 INFO L225 Difference]: With dead ends: 5379 [2022-03-15 15:09:40,782 INFO L226 Difference]: Without dead ends: 5379 [2022-03-15 15:09:40,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-03-15 15:09:40,782 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 628 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:40,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 1411 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 15:09:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-03-15 15:09:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2605. [2022-03-15 15:09:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2597 states have (on average 1.9599537928378898) internal successors, (5090), 2604 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 5090 transitions. [2022-03-15 15:09:40,825 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 5090 transitions. Word has length 105 [2022-03-15 15:09:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:40,825 INFO L470 AbstractCegarLoop]: Abstraction has 2605 states and 5090 transitions. [2022-03-15 15:09:40,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 5090 transitions. [2022-03-15 15:09:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-15 15:09:40,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:40,827 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:40,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:41,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 15:09:41,027 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:41,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:41,028 INFO L85 PathProgramCache]: Analyzing trace with hash 49907308, now seen corresponding path program 41 times [2022-03-15 15:09:41,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:41,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445307720] [2022-03-15 15:09:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-03-15 15:09:41,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:41,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445307720] [2022-03-15 15:09:41,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445307720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:41,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754621289] [2022-03-15 15:09:41,212 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:09:41,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:41,213 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:41,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 15:09:41,492 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:09:41,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:41,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 15:09:41,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:41,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:09:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:41,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 15:09:41,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754621289] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:41,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 15:09:41,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-15 15:09:41,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318814161] [2022-03-15 15:09:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:41,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 15:09:41,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 15:09:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-03-15 15:09:41,779 INFO L87 Difference]: Start difference. First operand 2605 states and 5090 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:42,120 INFO L93 Difference]: Finished difference Result 4902 states and 9651 transitions. [2022-03-15 15:09:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 15:09:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-03-15 15:09:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:42,125 INFO L225 Difference]: With dead ends: 4902 [2022-03-15 15:09:42,126 INFO L226 Difference]: Without dead ends: 4902 [2022-03-15 15:09:42,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-15 15:09:42,126 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 562 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:42,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 1394 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 15:09:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2022-03-15 15:09:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 2634. [2022-03-15 15:09:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2626 states have (on average 1.9603960396039604) internal successors, (5148), 2633 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 5148 transitions. [2022-03-15 15:09:42,166 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 5148 transitions. Word has length 105 [2022-03-15 15:09:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:42,166 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 5148 transitions. [2022-03-15 15:09:42,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 5148 transitions. [2022-03-15 15:09:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-03-15 15:09:42,167 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:42,168 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:42,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 15:09:42,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:42,368 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 225817577, now seen corresponding path program 1 times [2022-03-15 15:09:42,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:42,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854256612] [2022-03-15 15:09:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-15 15:09:42,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:42,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854256612] [2022-03-15 15:09:42,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854256612] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 15:09:42,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 15:09:42,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 15:09:42,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488021141] [2022-03-15 15:09:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-15 15:09:42,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 15:09:42,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:42,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 15:09:42,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:42,436 INFO L87 Difference]: Start difference. First operand 2634 states and 5148 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:42,532 INFO L93 Difference]: Finished difference Result 2900 states and 5680 transitions. [2022-03-15 15:09:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 15:09:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-03-15 15:09:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:42,538 INFO L225 Difference]: With dead ends: 2900 [2022-03-15 15:09:42,538 INFO L226 Difference]: Without dead ends: 2753 [2022-03-15 15:09:42,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 15:09:42,539 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 128 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:42,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 366 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 15:09:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2022-03-15 15:09:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2211. [2022-03-15 15:09:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2204 states have (on average 1.9491833030852994) internal successors, (4296), 2210 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4296 transitions. [2022-03-15 15:09:42,559 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4296 transitions. Word has length 114 [2022-03-15 15:09:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:42,559 INFO L470 AbstractCegarLoop]: Abstraction has 2211 states and 4296 transitions. [2022-03-15 15:09:42,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4296 transitions. [2022-03-15 15:09:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:42,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:42,561 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:42,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-15 15:09:42,561 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1779983633, now seen corresponding path program 1 times [2022-03-15 15:09:42,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:42,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693957628] [2022-03-15 15:09:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:42,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:42,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693957628] [2022-03-15 15:09:42,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693957628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:42,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403587560] [2022-03-15 15:09:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:42,869 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 15:09:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:43,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 15:09:43,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:43,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:43,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:43,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:43,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:43,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:44,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:44,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:44,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 15:09:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:44,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:44,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:44,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:45,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403587560] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:45,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:45,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:09:45,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925277235] [2022-03-15 15:09:45,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:45,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:09:45,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:09:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:09:45,458 INFO L87 Difference]: Start difference. First operand 2211 states and 4296 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:48,862 INFO L93 Difference]: Finished difference Result 7926 states and 15628 transitions. [2022-03-15 15:09:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 15:09:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:09:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:48,871 INFO L225 Difference]: With dead ends: 7926 [2022-03-15 15:09:48,872 INFO L226 Difference]: Without dead ends: 7914 [2022-03-15 15:09:48,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 15:09:48,873 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 2423 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:48,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 3947 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2912 Invalid, 0 Unknown, 220 Unchecked, 1.5s Time] [2022-03-15 15:09:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2022-03-15 15:09:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 3015. [2022-03-15 15:09:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 3008 states have (on average 1.9763962765957446) internal successors, (5945), 3014 states have internal predecessors, (5945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 5945 transitions. [2022-03-15 15:09:48,910 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 5945 transitions. Word has length 134 [2022-03-15 15:09:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:48,910 INFO L470 AbstractCegarLoop]: Abstraction has 3015 states and 5945 transitions. [2022-03-15 15:09:48,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 5945 transitions. [2022-03-15 15:09:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:48,912 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:48,912 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:48,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 15:09:49,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:49,113 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2062391747, now seen corresponding path program 2 times [2022-03-15 15:09:49,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:49,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496454360] [2022-03-15 15:09:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:49,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:49,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496454360] [2022-03-15 15:09:49,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496454360] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:49,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260327802] [2022-03-15 15:09:49,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:09:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:49,414 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:49,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 15:09:49,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 15:09:49,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:09:49,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:09:49,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:50,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:50,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:50,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:50,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:50,654 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-15 15:09:50,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 59 [2022-03-15 15:09:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:50,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:51,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:51,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260327802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:51,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:51,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:09:51,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451913759] [2022-03-15 15:09:51,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:51,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:09:51,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:09:51,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:09:51,883 INFO L87 Difference]: Start difference. First operand 3015 states and 5945 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:09:55,572 INFO L93 Difference]: Finished difference Result 7629 states and 15050 transitions. [2022-03-15 15:09:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 15:09:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:09:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:09:55,582 INFO L225 Difference]: With dead ends: 7629 [2022-03-15 15:09:55,583 INFO L226 Difference]: Without dead ends: 7620 [2022-03-15 15:09:55,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1110, Invalid=5370, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 15:09:55,584 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1997 mSDsluCounter, 4464 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 15:09:55,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1997 Valid, 4794 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 3952 Invalid, 0 Unknown, 279 Unchecked, 1.9s Time] [2022-03-15 15:09:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2022-03-15 15:09:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 3152. [2022-03-15 15:09:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3145 states have (on average 1.9774244833068362) internal successors, (6219), 3151 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 6219 transitions. [2022-03-15 15:09:55,635 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 6219 transitions. Word has length 134 [2022-03-15 15:09:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:09:55,636 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 6219 transitions. [2022-03-15 15:09:55,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:09:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 6219 transitions. [2022-03-15 15:09:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:09:55,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:09:55,639 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:09:55,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 15:09:55,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:55,855 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:09:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:09:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1179672212, now seen corresponding path program 1 times [2022-03-15 15:09:55,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:09:55,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019486270] [2022-03-15 15:09:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:09:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:56,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:09:56,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019486270] [2022-03-15 15:09:56,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019486270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:09:56,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602004627] [2022-03-15 15:09:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:09:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:09:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:09:56,167 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:09:56,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 15:09:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:09:56,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:09:56,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:09:57,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:09:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:09:57,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:09:57,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:09:57,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:09:57,388 INFO L353 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2022-03-15 15:09:57,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2022-03-15 15:09:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:57,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:09:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:57,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:09:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:09:58,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602004627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:09:58,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:09:58,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:09:58,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985264485] [2022-03-15 15:09:58,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:09:58,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:09:58,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:09:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:09:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 15:09:58,499 INFO L87 Difference]: Start difference. First operand 3152 states and 6219 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:01,949 INFO L93 Difference]: Finished difference Result 7625 states and 15041 transitions. [2022-03-15 15:10:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 15:10:01,949 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:10:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:01,959 INFO L225 Difference]: With dead ends: 7625 [2022-03-15 15:10:01,959 INFO L226 Difference]: Without dead ends: 7597 [2022-03-15 15:10:01,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1163, Invalid=5977, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 15:10:01,960 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 2466 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:01,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2466 Valid, 4041 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3229 Invalid, 0 Unknown, 498 Unchecked, 1.6s Time] [2022-03-15 15:10:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2022-03-15 15:10:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 3312. [2022-03-15 15:10:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3305 states have (on average 1.9797276853252648) internal successors, (6543), 3311 states have internal predecessors, (6543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 6543 transitions. [2022-03-15 15:10:02,018 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 6543 transitions. Word has length 134 [2022-03-15 15:10:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:02,019 INFO L470 AbstractCegarLoop]: Abstraction has 3312 states and 6543 transitions. [2022-03-15 15:10:02,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 6543 transitions. [2022-03-15 15:10:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:10:02,022 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:02,022 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:02,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 15:10:02,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 15:10:02,243 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:10:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash -839246923, now seen corresponding path program 1 times [2022-03-15 15:10:02,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:02,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488015275] [2022-03-15 15:10:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:02,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:02,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488015275] [2022-03-15 15:10:02,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488015275] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:02,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388610917] [2022-03-15 15:10:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:02,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:02,696 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:02,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 15:10:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:02,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 15:10:02,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:03,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:10:03,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:10:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:10:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:10:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:10:04,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:10:04,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:10:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:10:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:04,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-03-15 15:10:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:09,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:11,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:11,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:10:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:12,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388610917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:12,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:12,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-03-15 15:10:12,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133611952] [2022-03-15 15:10:12,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:12,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 15:10:12,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 15:10:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1739, Unknown=2, NotChecked=0, Total=1980 [2022-03-15 15:10:12,417 INFO L87 Difference]: Start difference. First operand 3312 states and 6543 transitions. Second operand has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:47,441 INFO L93 Difference]: Finished difference Result 9029 states and 17852 transitions. [2022-03-15 15:10:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 15:10:47,441 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:10:47,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:47,450 INFO L225 Difference]: With dead ends: 9029 [2022-03-15 15:10:47,450 INFO L226 Difference]: Without dead ends: 9017 [2022-03-15 15:10:47,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 266 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=1670, Invalid=8614, Unknown=18, NotChecked=0, Total=10302 [2022-03-15 15:10:47,452 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 2878 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 4140 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2878 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 5818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1332 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:47,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2878 Valid, 5121 Invalid, 5818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4140 Invalid, 0 Unknown, 1332 Unchecked, 2.3s Time] [2022-03-15 15:10:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2022-03-15 15:10:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 3517. [2022-03-15 15:10:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3510 states have (on average 1.9814814814814814) internal successors, (6955), 3516 states have internal predecessors, (6955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 6955 transitions. [2022-03-15 15:10:47,495 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 6955 transitions. Word has length 134 [2022-03-15 15:10:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:47,495 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 6955 transitions. [2022-03-15 15:10:47,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 6955 transitions. [2022-03-15 15:10:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:10:47,497 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:47,497 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:47,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 15:10:47,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 15:10:47,698 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:10:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:47,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1180858669, now seen corresponding path program 1 times [2022-03-15 15:10:47,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:47,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987038920] [2022-03-15 15:10:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:47,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:47,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987038920] [2022-03-15 15:10:47,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987038920] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:47,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250432452] [2022-03-15 15:10:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:47,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:47,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:47,897 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:47,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 15:10:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:48,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:10:48,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:48,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:10:48,864 INFO L353 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-03-15 15:10:48,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-03-15 15:10:48,890 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-03-15 15:10:48,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:10:48,928 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-03-15 15:10:48,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:10:48,977 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-03-15 15:10:48,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:10:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:49,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:49,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250432452] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:10:49,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:10:49,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 37 [2022-03-15 15:10:49,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806709003] [2022-03-15 15:10:49,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:10:49,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 15:10:49,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:10:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 15:10:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1255, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 15:10:49,475 INFO L87 Difference]: Start difference. First operand 3517 states and 6955 transitions. Second operand has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:10:54,240 INFO L93 Difference]: Finished difference Result 7638 states and 15074 transitions. [2022-03-15 15:10:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 15:10:54,241 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:10:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:10:54,248 INFO L225 Difference]: With dead ends: 7638 [2022-03-15 15:10:54,248 INFO L226 Difference]: Without dead ends: 7610 [2022-03-15 15:10:54,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3557 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1853, Invalid=9919, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 15:10:54,249 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 2670 mSDsluCounter, 4644 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:10:54,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2670 Valid, 5058 Invalid, 5502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 15:10:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2022-03-15 15:10:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 3445. [2022-03-15 15:10:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 3438 states have (on average 1.973240255962769) internal successors, (6784), 3444 states have internal predecessors, (6784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 6784 transitions. [2022-03-15 15:10:54,287 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 6784 transitions. Word has length 134 [2022-03-15 15:10:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:10:54,288 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 6784 transitions. [2022-03-15 15:10:54,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 6.297297297297297) internal successors, (233), 38 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:10:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 6784 transitions. [2022-03-15 15:10:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:10:54,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:10:54,290 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:10:54,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-03-15 15:10:54,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 15:10:54,491 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:10:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:10:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1411337857, now seen corresponding path program 3 times [2022-03-15 15:10:54,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:10:54,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555458774] [2022-03-15 15:10:54,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:10:54,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:10:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:10:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:54,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:10:54,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555458774] [2022-03-15 15:10:54,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555458774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:10:54,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538717809] [2022-03-15 15:10:54,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:10:54,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:10:54,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:10:54,779 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:10:54,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 15:10:55,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 15:10:55,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:10:55,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 15:10:55,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:10:55,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:10:55,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:55,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:10:56,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:10:56,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:10:56,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:10:56,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 15:10:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:10:56,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:10:57,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) is different from false [2022-03-15 15:10:57,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2022-03-15 15:10:58,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-03-15 15:11:00,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) is different from false [2022-03-15 15:11:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-15 15:11:00,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538717809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:00,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:00,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:11:00,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803396444] [2022-03-15 15:11:00,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:00,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:11:00,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:11:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1172, Unknown=4, NotChecked=292, Total=1640 [2022-03-15 15:11:00,712 INFO L87 Difference]: Start difference. First operand 3445 states and 6784 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:02,400 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-03-15 15:11:03,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2022-03-15 15:11:03,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-15 15:11:04,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))))) is different from false [2022-03-15 15:11:06,344 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| 1) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (and (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_5507 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_5507))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|)) is different from false [2022-03-15 15:11:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:07,425 INFO L93 Difference]: Finished difference Result 12096 states and 23991 transitions. [2022-03-15 15:11:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 15:11:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:11:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:07,442 INFO L225 Difference]: With dead ends: 12096 [2022-03-15 15:11:07,443 INFO L226 Difference]: Without dead ends: 12093 [2022-03-15 15:11:07,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1325, Invalid=6358, Unknown=9, NotChecked=1620, Total=9312 [2022-03-15 15:11:07,444 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 2354 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 3664 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 5117 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 3664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1879 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:07,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2354 Valid, 5117 Invalid, 5687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 3664 Invalid, 0 Unknown, 1879 Unchecked, 1.8s Time] [2022-03-15 15:11:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12093 states. [2022-03-15 15:11:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12093 to 3465. [2022-03-15 15:11:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3458 states have (on average 1.9733950260266049) internal successors, (6824), 3464 states have internal predecessors, (6824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 6824 transitions. [2022-03-15 15:11:07,525 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 6824 transitions. Word has length 134 [2022-03-15 15:11:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:07,526 INFO L470 AbstractCegarLoop]: Abstraction has 3465 states and 6824 transitions. [2022-03-15 15:11:07,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 6824 transitions. [2022-03-15 15:11:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:11:07,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:07,528 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:07,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-03-15 15:11:07,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 15:11:07,729 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:11:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1408959273, now seen corresponding path program 4 times [2022-03-15 15:11:07,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:07,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535423338] [2022-03-15 15:11:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:07,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:07,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535423338] [2022-03-15 15:11:07,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535423338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:07,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976733381] [2022-03-15 15:11:07,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:11:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:07,987 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:11:07,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 15:11:08,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:11:08,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:11:08,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 15:11:08,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:09,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:11:09,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:11:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:11:09,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:11:09,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:09,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:11:09,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 15:11:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:09,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:11:15,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (and (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_5658 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_5658))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-03-15 15:11:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:33,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976733381] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:33,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:33,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 41 [2022-03-15 15:11:33,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452348602] [2022-03-15 15:11:33,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:33,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 15:11:33,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 15:11:33,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1444, Unknown=17, NotChecked=78, Total=1722 [2022-03-15 15:11:33,454 INFO L87 Difference]: Start difference. First operand 3465 states and 6824 transitions. Second operand has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:43,197 WARN L228 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 75 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 15:11:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:45,868 INFO L93 Difference]: Finished difference Result 8922 states and 17649 transitions. [2022-03-15 15:11:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 15:11:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:11:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:45,877 INFO L225 Difference]: With dead ends: 8922 [2022-03-15 15:11:45,877 INFO L226 Difference]: Without dead ends: 8916 [2022-03-15 15:11:45,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 249 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3076 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=1558, Invalid=7933, Unknown=19, NotChecked=192, Total=9702 [2022-03-15 15:11:45,878 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 2320 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 3166 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2320 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 5447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 3166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1997 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:45,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2320 Valid, 4397 Invalid, 5447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 3166 Invalid, 0 Unknown, 1997 Unchecked, 1.8s Time] [2022-03-15 15:11:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2022-03-15 15:11:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 3459. [2022-03-15 15:11:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3452 states have (on average 1.9733487833140209) internal successors, (6812), 3458 states have internal predecessors, (6812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 6812 transitions. [2022-03-15 15:11:45,921 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 6812 transitions. Word has length 134 [2022-03-15 15:11:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:45,921 INFO L470 AbstractCegarLoop]: Abstraction has 3459 states and 6812 transitions. [2022-03-15 15:11:45,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.7560975609756095) internal successors, (236), 42 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 6812 transitions. [2022-03-15 15:11:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:11:45,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:45,924 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:45,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 15:11:46,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-15 15:11:46,124 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:11:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -467560269, now seen corresponding path program 5 times [2022-03-15 15:11:46,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:46,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246435871] [2022-03-15 15:11:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:46,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:46,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246435871] [2022-03-15 15:11:46,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246435871] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:46,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955660782] [2022-03-15 15:11:46,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 15:11:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:46,389 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:11:46,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 15:11:46,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-03-15 15:11:46,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:11:46,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 15:11:46,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:47,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:11:47,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:11:47,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:11:47,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:47,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:11:47,720 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-15 15:11:47,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 59 [2022-03-15 15:11:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:47,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:11:48,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)) (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5810 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) is different from false [2022-03-15 15:11:50,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) is different from false [2022-03-15 15:11:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 235 trivial. 1 not checked. [2022-03-15 15:11:50,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955660782] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:11:50,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:11:50,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 40 [2022-03-15 15:11:50,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739378547] [2022-03-15 15:11:50,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:11:50,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 15:11:50,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:11:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 15:11:50,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1322, Unknown=2, NotChecked=150, Total=1640 [2022-03-15 15:11:50,611 INFO L87 Difference]: Start difference. First operand 3459 states and 6812 transitions. Second operand has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:52,529 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= |c_~#cache~0.base| 1) (<= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= (div (+ .cse7 |c_~#cache~0.offset|) (- 28)) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-03-15 15:11:53,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)) (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_5810 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) is different from false [2022-03-15 15:11:56,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* (- 1) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= |c_~#cache~0.base| 1) (<= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int)) (or (and (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)))) (forall ((v_ArrVal_5810 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_5810))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 1) (<= (div (+ .cse7 |c_~#cache~0.offset|) (- 28)) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse7) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset|)) (- 28)) 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 |c_t_funThread1of1ForFork0_#t~post34#1|))) is different from false [2022-03-15 15:11:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:11:57,200 INFO L93 Difference]: Finished difference Result 12322 states and 24440 transitions. [2022-03-15 15:11:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 15:11:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:11:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:11:57,220 INFO L225 Difference]: With dead ends: 12322 [2022-03-15 15:11:57,220 INFO L226 Difference]: Without dead ends: 12313 [2022-03-15 15:11:57,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1334, Invalid=7237, Unknown=5, NotChecked=930, Total=9506 [2022-03-15 15:11:57,222 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 2479 mSDsluCounter, 5654 mSDsCounter, 0 mSdLazyCounter, 4471 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 6042 SdHoareTripleChecker+Invalid, 6505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 4471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 15:11:57,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2479 Valid, 6042 Invalid, 6505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 4471 Invalid, 0 Unknown, 1894 Unchecked, 2.3s Time] [2022-03-15 15:11:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12313 states. [2022-03-15 15:11:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12313 to 3536. [2022-03-15 15:11:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3529 states have (on average 1.9739302918673844) internal successors, (6966), 3535 states have internal predecessors, (6966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 6966 transitions. [2022-03-15 15:11:57,328 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 6966 transitions. Word has length 134 [2022-03-15 15:11:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:11:57,328 INFO L470 AbstractCegarLoop]: Abstraction has 3536 states and 6966 transitions. [2022-03-15 15:11:57,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 5.9) internal successors, (236), 41 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:11:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 6966 transitions. [2022-03-15 15:11:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:11:57,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:11:57,331 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:11:57,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 15:11:57,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 15:11:57,532 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:11:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:11:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash 416790693, now seen corresponding path program 6 times [2022-03-15 15:11:57,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:11:57,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229234135] [2022-03-15 15:11:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:11:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:11:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:11:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:57,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:11:57,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229234135] [2022-03-15 15:11:57,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229234135] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:11:57,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871346870] [2022-03-15 15:11:57,782 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 15:11:57,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:11:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:11:57,784 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:11:57,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 15:11:58,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 15:11:58,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:11:58,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 15:11:58,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:11:58,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:11:58,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:11:59,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:11:59,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:11:59,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:11:59,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 15:11:59,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:11:59,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-03-15 15:11:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:11:59,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:00,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:00,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:00,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:12:00,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:12:00,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:00,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:12:00,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:12:00,347 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 15:12:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:00,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871346870] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:12:00,731 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:12:00,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 44 [2022-03-15 15:12:00,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403892895] [2022-03-15 15:12:00,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:12:00,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 15:12:00,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 15:12:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 15:12:00,732 INFO L87 Difference]: Start difference. First operand 3536 states and 6966 transitions. Second operand has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:12:09,744 INFO L93 Difference]: Finished difference Result 10209 states and 20212 transitions. [2022-03-15 15:12:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-03-15 15:12:09,744 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:12:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:12:09,754 INFO L225 Difference]: With dead ends: 10209 [2022-03-15 15:12:09,755 INFO L226 Difference]: Without dead ends: 10197 [2022-03-15 15:12:09,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 258 SyntacticMatches, 9 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7740 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3549, Invalid=17913, Unknown=0, NotChecked=0, Total=21462 [2022-03-15 15:12:09,756 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 2848 mSDsluCounter, 4266 mSDsCounter, 0 mSdLazyCounter, 4740 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2848 SdHoareTripleChecker+Valid, 4670 SdHoareTripleChecker+Invalid, 5819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 4740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 15:12:09,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2848 Valid, 4670 Invalid, 5819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 4740 Invalid, 0 Unknown, 686 Unchecked, 3.2s Time] [2022-03-15 15:12:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10197 states. [2022-03-15 15:12:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10197 to 3782. [2022-03-15 15:12:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3775 states have (on average 1.9756291390728478) internal successors, (7458), 3781 states have internal predecessors, (7458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 7458 transitions. [2022-03-15 15:12:09,808 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 7458 transitions. Word has length 134 [2022-03-15 15:12:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:12:09,808 INFO L470 AbstractCegarLoop]: Abstraction has 3782 states and 7458 transitions. [2022-03-15 15:12:09,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 5.363636363636363) internal successors, (236), 45 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:12:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 7458 transitions. [2022-03-15 15:12:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:12:09,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:12:09,811 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:12:09,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-03-15 15:12:10,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:10,013 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:12:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:12:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1462386007, now seen corresponding path program 2 times [2022-03-15 15:12:10,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:12:10,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173480499] [2022-03-15 15:12:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:12:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:12:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:12:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:10,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:12:10,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173480499] [2022-03-15 15:12:10,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173480499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:12:10,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211355277] [2022-03-15 15:12:10,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 15:12:10,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:12:10,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:12:10,372 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:12:10,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 15:12:10,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 15:12:10,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:12:10,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 15:12:10,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:12:11,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:12:11,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:12:11,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:12:11,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:12:11,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:12:11,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 15:12:11,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:12:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:12:11,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:12:11,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:11,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:12:12,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:12,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2022-03-15 15:12:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:21,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:12:32,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:32,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:12:32,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:12:32,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:32,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:32,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:12:32,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:12:32,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:12:32,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:12:32,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:12:32,419 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 15:12:32,423 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 15:12:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:12:32,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211355277] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:12:32,935 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:12:32,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 49 [2022-03-15 15:12:32,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429348130] [2022-03-15 15:12:32,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:12:32,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 15:12:32,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:12:32,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 15:12:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2176, Unknown=8, NotChecked=0, Total=2450 [2022-03-15 15:12:32,936 INFO L87 Difference]: Start difference. First operand 3782 states and 7458 transitions. Second operand has 50 states, 49 states have (on average 4.816326530612245) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:12,055 INFO L93 Difference]: Finished difference Result 9113 states and 18048 transitions. [2022-03-15 15:13:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 15:13:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 4.816326530612245) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:13:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:12,066 INFO L225 Difference]: With dead ends: 9113 [2022-03-15 15:13:12,066 INFO L226 Difference]: Without dead ends: 9113 [2022-03-15 15:13:12,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 262 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3184 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=1740, Invalid=8544, Unknown=18, NotChecked=0, Total=10302 [2022-03-15 15:13:12,067 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 2735 mSDsluCounter, 5238 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 5514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2760 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:12,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2735 Valid, 5636 Invalid, 5514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2613 Invalid, 0 Unknown, 2760 Unchecked, 1.4s Time] [2022-03-15 15:13:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2022-03-15 15:13:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 3790. [2022-03-15 15:13:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3783 states have (on average 1.9756806767116046) internal successors, (7474), 3789 states have internal predecessors, (7474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 7474 transitions. [2022-03-15 15:13:12,137 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 7474 transitions. Word has length 134 [2022-03-15 15:13:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:12,138 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 7474 transitions. [2022-03-15 15:13:12,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.816326530612245) internal successors, (236), 50 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 7474 transitions. [2022-03-15 15:13:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:13:12,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:12,140 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:12,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 15:13:12,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:13:12,341 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:13:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash -165019217, now seen corresponding path program 3 times [2022-03-15 15:13:12,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:12,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210372712] [2022-03-15 15:13:12,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:12,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:12,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210372712] [2022-03-15 15:13:12,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210372712] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:13:12,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377610751] [2022-03-15 15:13:12,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 15:13:12,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:13:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:13:12,749 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:13:12,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 15:13:13,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 15:13:13,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:13:13,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 15:13:13,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:13:13,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:13:13,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:13:13,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:13:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:13:13,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:13,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:13:14,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 15:13:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:13:14,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:14,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:14,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:14,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:14,300 INFO L353 Elim1Store]: treesize reduction 188, result has 15.7 percent of original size [2022-03-15 15:13:14,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 59 [2022-03-15 15:13:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:14,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:13:22,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:22,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:13:22,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:13:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:22,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:13:22,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:13:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:22,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:22,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:13:22,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:13:22,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:22,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 15:13:22,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 15:13:22,322 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 15:13:22,326 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 15:13:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:22,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377610751] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 15:13:22,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 15:13:22,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 46 [2022-03-15 15:13:22,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951744157] [2022-03-15 15:13:22,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-15 15:13:22,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 15:13:22,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 15:13:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 15:13:22,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1933, Unknown=3, NotChecked=0, Total=2162 [2022-03-15 15:13:22,783 INFO L87 Difference]: Start difference. First operand 3790 states and 7474 transitions. Second operand has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 15:13:29,343 INFO L93 Difference]: Finished difference Result 9397 states and 18596 transitions. [2022-03-15 15:13:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 15:13:29,344 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-03-15 15:13:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 15:13:29,352 INFO L225 Difference]: With dead ends: 9397 [2022-03-15 15:13:29,352 INFO L226 Difference]: Without dead ends: 9385 [2022-03-15 15:13:29,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 252 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2041, Invalid=9946, Unknown=3, NotChecked=0, Total=11990 [2022-03-15 15:13:29,353 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 2986 mSDsluCounter, 5665 mSDsCounter, 0 mSdLazyCounter, 4123 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2986 SdHoareTripleChecker+Valid, 6071 SdHoareTripleChecker+Invalid, 6541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 4123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2066 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 15:13:29,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2986 Valid, 6071 Invalid, 6541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 4123 Invalid, 0 Unknown, 2066 Unchecked, 2.6s Time] [2022-03-15 15:13:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2022-03-15 15:13:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 3824. [2022-03-15 15:13:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3817 states have (on average 1.9758973015457166) internal successors, (7542), 3823 states have internal predecessors, (7542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 7542 transitions. [2022-03-15 15:13:29,401 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 7542 transitions. Word has length 134 [2022-03-15 15:13:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 15:13:29,401 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 7542 transitions. [2022-03-15 15:13:29,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 5.130434782608695) internal successors, (236), 47 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 15:13:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 7542 transitions. [2022-03-15 15:13:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-15 15:13:29,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 15:13:29,404 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 15:13:29,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 15:13:29,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:13:29,604 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-15 15:13:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 15:13:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 768196573, now seen corresponding path program 4 times [2022-03-15 15:13:29,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 15:13:29,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006989684] [2022-03-15 15:13:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 15:13:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 15:13:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 15:13:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:30,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 15:13:30,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006989684] [2022-03-15 15:13:30,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006989684] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 15:13:30,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838402248] [2022-03-15 15:13:30,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 15:13:30,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 15:13:30,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 15:13:30,034 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 15:13:30,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 15:13:30,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 15:13:30,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 15:13:30,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 15:13:30,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 15:13:30,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-15 15:13:30,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 15:13:30,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:30,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-03-15 15:13:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-03-15 15:13:31,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-03-15 15:13:31,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,191 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 15:13:31,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2022-03-15 15:13:31,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:31,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,339 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:31,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,370 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-03-15 15:13:31,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 15:13:31,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 15:13:31,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2022-03-15 15:13:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-03-15 15:13:41,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 15:13:58,249 INFO L353 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-03-15 15:13:58,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 7096 treesize of output 7088 [2022-03-15 15:13:58,502 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 15:13:58,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4513 treesize of output 4505 [2022-03-15 15:13:58,541 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 15:13:58,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 15:13:58,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-15 15:13:58,767 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 15:13:58,771 INFO L158 Benchmark]: Toolchain (without parser) took 340763.77ms. Allocated memory was 175.1MB in the beginning and 324.0MB in the end (delta: 148.9MB). Free memory was 125.2MB in the beginning and 212.8MB in the end (delta: -87.6MB). Peak memory consumption was 230.2MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.07ms. Allocated memory is still 175.1MB. Free memory was 125.0MB in the beginning and 137.3MB in the end (delta: -12.3MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.51ms. Allocated memory is still 175.1MB. Free memory was 137.3MB in the beginning and 134.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 175.1MB. Free memory was 134.7MB in the beginning and 133.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: RCFGBuilder took 397.34ms. Allocated memory is still 175.1MB. Free memory was 133.0MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,771 INFO L158 Benchmark]: TraceAbstraction took 339652.92ms. Allocated memory was 175.1MB in the beginning and 324.0MB in the end (delta: 148.9MB). Free memory was 117.9MB in the beginning and 212.8MB in the end (delta: -94.9MB). Peak memory consumption was 222.3MB. Max. memory is 8.0GB. [2022-03-15 15:13:58,772 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 604.07ms. Allocated memory is still 175.1MB. Free memory was 125.0MB in the beginning and 137.3MB in the end (delta: -12.3MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.51ms. Allocated memory is still 175.1MB. Free memory was 137.3MB in the beginning and 134.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 175.1MB. Free memory was 134.7MB in the beginning and 133.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 397.34ms. Allocated memory is still 175.1MB. Free memory was 133.0MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 339652.92ms. Allocated memory was 175.1MB in the beginning and 324.0MB in the end (delta: 148.9MB). Free memory was 117.9MB in the beginning and 212.8MB in the end (delta: -94.9MB). Peak memory consumption was 222.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 15:13:58,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...