/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:12:05,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:12:05,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:12:05,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:12:05,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:12:05,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:12:05,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:12:05,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:12:05,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:12:05,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:12:05,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:12:05,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:12:05,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:12:05,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:12:05,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:12:05,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:12:05,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:12:05,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:12:05,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:12:05,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:12:05,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:12:05,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:12:05,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:12:05,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:12:05,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:12:05,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:12:05,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:12:05,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:12:05,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:12:05,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:12:05,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:12:05,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:12:05,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:12:05,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:12:05,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:12:05,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:12:05,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:12:05,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:12:05,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:12:05,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:12:05,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:12:05,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:12:05,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:12:05,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:12:05,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:12:05,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:12:05,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:12:05,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:12:05,839 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:12:05,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:12:05,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:12:05,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:12:05,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:12:05,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:12:05,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:12:05,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:05,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:12:05,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:12:05,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:12:05,843 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-15 20:12:06,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:12:06,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:12:06,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:12:06,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:12:06,054 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:12:06,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i [2022-03-15 20:12:06,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9ddc076/0561427d9240464fa61b910d97b73dc2/FLAG0997afd19 [2022-03-15 20:12:06,534 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:12:06,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.i [2022-03-15 20:12:06,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9ddc076/0561427d9240464fa61b910d97b73dc2/FLAG0997afd19 [2022-03-15 20:12:06,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9ddc076/0561427d9240464fa61b910d97b73dc2 [2022-03-15 20:12:06,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:12:06,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:12:06,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:06,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:12:06,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:12:06,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:06" (1/1) ... [2022-03-15 20:12:06,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d1f701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:06, skipping insertion in model container [2022-03-15 20:12:06,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:06" (1/1) ... [2022-03-15 20:12:06,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:12:06,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:12:07,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:07,044 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:12:07,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:07,139 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:12:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07 WrapperNode [2022-03-15 20:12:07,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:07,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:07,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:12:07,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:12:07,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,203 INFO L137 Inliner]: procedures = 365, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2022-03-15 20:12:07,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:07,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:12:07,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:12:07,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:12:07,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:12:07,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:12:07,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:12:07,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:12:07,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:12:07,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 20:12:07,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 20:12:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:12:07,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:12:07,315 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:12:07,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:12:07,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:12:07,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:12:07,317 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:12:07,467 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:12:07,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:12:07,644 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:12:07,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:12:07,650 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:12:07,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:07 BoogieIcfgContainer [2022-03-15 20:12:07,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:12:07,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:12:07,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:12:07,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:12:07,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:12:06" (1/3) ... [2022-03-15 20:12:07,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545d18da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:07, skipping insertion in model container [2022-03-15 20:12:07,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07" (2/3) ... [2022-03-15 20:12:07,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545d18da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:07, skipping insertion in model container [2022-03-15 20:12:07,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:07" (3/3) ... [2022-03-15 20:12:07,657 INFO L111 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2022-03-15 20:12:07,660 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:12:07,661 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:12:07,661 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-03-15 20:12:07,661 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:12:07,698 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,699 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,711 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:07,712 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:12:07,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:12:07,755 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:12:07,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-03-15 20:12:07,765 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:12:07,771 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 114 transitions, 233 flow [2022-03-15 20:12:07,773 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 114 transitions, 233 flow [2022-03-15 20:12:07,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 114 transitions, 233 flow [2022-03-15 20:12:07,828 INFO L129 PetriNetUnfolder]: 0/113 cut-off events. [2022-03-15 20:12:07,828 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:12:07,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 113 events. 0/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:12:07,835 INFO L116 LiptonReduction]: Number of co-enabled transitions 2100 [2022-03-15 20:12:10,529 INFO L131 LiptonReduction]: Checked pairs total: 15937 [2022-03-15 20:12:10,529 INFO L133 LiptonReduction]: Total number of compositions: 75 [2022-03-15 20:12:10,534 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 49 transitions, 103 flow [2022-03-15 20:12:10,563 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 531 states, 505 states have (on average 2.003960396039604) internal successors, (1012), 530 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 505 states have (on average 2.003960396039604) internal successors, (1012), 530 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:12:10,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:10,570 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:12:10,570 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 363, now seen corresponding path program 1 times [2022-03-15 20:12:10,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:10,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640442301] [2022-03-15 20:12:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:10,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:10,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640442301] [2022-03-15 20:12:10,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640442301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:10,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:10,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:12:10,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648189996] [2022-03-15 20:12:10,659 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:10,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:10,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:12:10,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:10,666 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:10,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:12:10,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:12:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:12:10,683 INFO L87 Difference]: Start difference. First operand has 531 states, 505 states have (on average 2.003960396039604) internal successors, (1012), 530 states have internal predecessors, (1012), 0 states have call successors, (0), 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, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:10,718 INFO L93 Difference]: Finished difference Result 529 states and 1010 transitions. [2022-03-15 20:12:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:12:10,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-03-15 20:12:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:10,728 INFO L225 Difference]: With dead ends: 529 [2022-03-15 20:12:10,728 INFO L226 Difference]: Without dead ends: 529 [2022-03-15 20:12:10,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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 20:12:10,731 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:10,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-03-15 20:12:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-03-15 20:12:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 505 states have (on average 2.0) internal successors, (1010), 528 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1010 transitions. [2022-03-15 20:12:10,774 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1010 transitions. Word has length 1 [2022-03-15 20:12:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:10,774 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1010 transitions. [2022-03-15 20:12:10,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1010 transitions. [2022-03-15 20:12:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:12:10,774 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:10,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:12:10,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:12:10,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:10,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 345109447, now seen corresponding path program 1 times [2022-03-15 20:12:10,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:10,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499145118] [2022-03-15 20:12:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:10,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:10,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499145118] [2022-03-15 20:12:10,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499145118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:10,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:10,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:12:10,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894952784] [2022-03-15 20:12:10,858 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:10,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:10,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:12:10,858 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:10,859 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:10,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:12:10,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:12:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:10,860 INFO L87 Difference]: Start difference. First operand 529 states and 1010 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:10,890 INFO L93 Difference]: Finished difference Result 484 states and 922 transitions. [2022-03-15 20:12:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:10,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-03-15 20:12:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:10,892 INFO L225 Difference]: With dead ends: 484 [2022-03-15 20:12:10,892 INFO L226 Difference]: Without dead ends: 484 [2022-03-15 20:12:10,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:10,893 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:10,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-03-15 20:12:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2022-03-15 20:12:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 469 states have (on average 1.9658848614072495) internal successors, (922), 483 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 922 transitions. [2022-03-15 20:12:10,907 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 922 transitions. Word has length 5 [2022-03-15 20:12:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:10,907 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 922 transitions. [2022-03-15 20:12:10,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 922 transitions. [2022-03-15 20:12:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:10,908 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:10,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:10,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:12:10,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -96643717, now seen corresponding path program 1 times [2022-03-15 20:12:10,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:10,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314230762] [2022-03-15 20:12:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:11,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314230762] [2022-03-15 20:12:11,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314230762] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:11,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963179943] [2022-03-15 20:12:11,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:11,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,016 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:11,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,017 INFO L87 Difference]: Start difference. First operand 484 states and 922 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,269 INFO L93 Difference]: Finished difference Result 906 states and 1719 transitions. [2022-03-15 20:12:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:12:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,273 INFO L225 Difference]: With dead ends: 906 [2022-03-15 20:12:11,273 INFO L226 Difference]: Without dead ends: 906 [2022-03-15 20:12:11,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,274 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-03-15 20:12:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 556. [2022-03-15 20:12:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 541 states have (on average 1.9741219963031422) internal successors, (1068), 555 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1068 transitions. [2022-03-15 20:12:11,286 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1068 transitions. Word has length 11 [2022-03-15 20:12:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,287 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 1068 transitions. [2022-03-15 20:12:11,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1068 transitions. [2022-03-15 20:12:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:11,287 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:12:11,288 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 942959430, now seen corresponding path program 1 times [2022-03-15 20:12:11,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644819062] [2022-03-15 20:12:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:11,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644819062] [2022-03-15 20:12:11,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644819062] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:11,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577052423] [2022-03-15 20:12:11,378 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,379 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:11,379 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:11,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,380 INFO L87 Difference]: Start difference. First operand 556 states and 1068 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,540 INFO L93 Difference]: Finished difference Result 654 states and 1248 transitions. [2022-03-15 20:12:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 20:12:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,544 INFO L225 Difference]: With dead ends: 654 [2022-03-15 20:12:11,544 INFO L226 Difference]: Without dead ends: 654 [2022-03-15 20:12:11,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,545 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 73 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-03-15 20:12:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 610. [2022-03-15 20:12:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 595 states have (on average 1.969747899159664) internal successors, (1172), 609 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1172 transitions. [2022-03-15 20:12:11,555 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1172 transitions. Word has length 11 [2022-03-15 20:12:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,555 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 1172 transitions. [2022-03-15 20:12:11,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1172 transitions. [2022-03-15 20:12:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:12:11,556 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:12:11,557 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash -54045814, now seen corresponding path program 1 times [2022-03-15 20:12:11,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100684991] [2022-03-15 20:12:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:11,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100684991] [2022-03-15 20:12:11,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100684991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:12:11,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603850313] [2022-03-15 20:12:11,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,588 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:12:11,589 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:12:11,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:12:11,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:11,590 INFO L87 Difference]: Start difference. First operand 610 states and 1172 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,610 INFO L93 Difference]: Finished difference Result 559 states and 1072 transitions. [2022-03-15 20:12:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 20:12:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,612 INFO L225 Difference]: With dead ends: 559 [2022-03-15 20:12:11,613 INFO L226 Difference]: Without dead ends: 559 [2022-03-15 20:12:11,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:11,613 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-03-15 20:12:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-03-15 20:12:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 551 states have (on average 1.9455535390199636) internal successors, (1072), 558 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1072 transitions. [2022-03-15 20:12:11,623 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1072 transitions. Word has length 13 [2022-03-15 20:12:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,623 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 1072 transitions. [2022-03-15 20:12:11,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1072 transitions. [2022-03-15 20:12:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:12:11,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:12:11,624 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 318097895, now seen corresponding path program 1 times [2022-03-15 20:12:11,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452871915] [2022-03-15 20:12:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:11,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452871915] [2022-03-15 20:12:11,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452871915] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:12:11,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646336070] [2022-03-15 20:12:11,648 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,653 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 52 transitions. [2022-03-15 20:12:11,653 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9814#(not (= (select (select |#pthreadsMutex| |~#m~0.base|) |~#m~0.offset|) 0))] [2022-03-15 20:12:11,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 20:12:11,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 20:12:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:12:11,716 INFO L87 Difference]: Start difference. First operand 559 states and 1072 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,733 INFO L93 Difference]: Finished difference Result 268 states and 462 transitions. [2022-03-15 20:12:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 16 [2022-03-15 20:12:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,734 INFO L225 Difference]: With dead ends: 268 [2022-03-15 20:12:11,734 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 20:12:11,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 20:12:11,735 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 20:12:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-03-15 20:12:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 262 states have (on average 1.7633587786259541) internal successors, (462), 267 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 462 transitions. [2022-03-15 20:12:11,740 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 462 transitions. Word has length 16 [2022-03-15 20:12:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,740 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 462 transitions. [2022-03-15 20:12:11,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 462 transitions. [2022-03-15 20:12:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:12:11,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:12:11,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1551585001, now seen corresponding path program 1 times [2022-03-15 20:12:11,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614611722] [2022-03-15 20:12:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:11,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614611722] [2022-03-15 20:12:11,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614611722] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:11,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812180909] [2022-03-15 20:12:11,819 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,823 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2022-03-15 20:12:11,823 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:11,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,824 INFO L87 Difference]: Start difference. First operand 268 states and 462 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,939 INFO L93 Difference]: Finished difference Result 334 states and 581 transitions. [2022-03-15 20:12:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-03-15 20:12:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,940 INFO L225 Difference]: With dead ends: 334 [2022-03-15 20:12:11,940 INFO L226 Difference]: Without dead ends: 314 [2022-03-15 20:12:11,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,942 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-03-15 20:12:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2022-03-15 20:12:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.7627737226277371) internal successors, (483), 278 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 483 transitions. [2022-03-15 20:12:11,949 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 483 transitions. Word has length 19 [2022-03-15 20:12:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,950 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 483 transitions. [2022-03-15 20:12:11,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 483 transitions. [2022-03-15 20:12:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:12:11,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,952 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] [2022-03-15 20:12:11,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:12:11,952 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1961881328, now seen corresponding path program 1 times [2022-03-15 20:12:11,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111256847] [2022-03-15 20:12:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:12,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111256847] [2022-03-15 20:12:12,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111256847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:12,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134955121] [2022-03-15 20:12:12,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 20:12:12,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:12,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:12,067 INFO L87 Difference]: Start difference. First operand 279 states and 483 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,298 INFO L93 Difference]: Finished difference Result 369 states and 624 transitions. [2022-03-15 20:12:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:12:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,300 INFO L225 Difference]: With dead ends: 369 [2022-03-15 20:12:12,300 INFO L226 Difference]: Without dead ends: 320 [2022-03-15 20:12:12,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:12,301 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-03-15 20:12:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 285. [2022-03-15 20:12:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 280 states have (on average 1.8214285714285714) internal successors, (510), 284 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 510 transitions. [2022-03-15 20:12:12,308 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 510 transitions. Word has length 20 [2022-03-15 20:12:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,308 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 510 transitions. [2022-03-15 20:12:12,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 510 transitions. [2022-03-15 20:12:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:12:12,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,312 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] [2022-03-15 20:12:12,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:12:12,312 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1100412124, now seen corresponding path program 1 times [2022-03-15 20:12:12,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979007795] [2022-03-15 20:12:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:12,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979007795] [2022-03-15 20:12:12,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979007795] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:12,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217472949] [2022-03-15 20:12:12,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 51 transitions. [2022-03-15 20:12:12,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:12,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:12,517 INFO L87 Difference]: Start difference. First operand 285 states and 510 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,704 INFO L93 Difference]: Finished difference Result 303 states and 522 transitions. [2022-03-15 20:12:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 20:12:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,706 INFO L225 Difference]: With dead ends: 303 [2022-03-15 20:12:12,706 INFO L226 Difference]: Without dead ends: 303 [2022-03-15 20:12:12,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:12:12,708 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 45 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-03-15 20:12:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 237. [2022-03-15 20:12:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.793991416309013) internal successors, (418), 236 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 418 transitions. [2022-03-15 20:12:12,713 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 418 transitions. Word has length 25 [2022-03-15 20:12:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,713 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 418 transitions. [2022-03-15 20:12:12,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 418 transitions. [2022-03-15 20:12:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:12:12,714 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,714 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] [2022-03-15 20:12:12,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:12:12,715 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash 992279189, now seen corresponding path program 1 times [2022-03-15 20:12:12,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829515976] [2022-03-15 20:12:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:12:12,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829515976] [2022-03-15 20:12:12,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829515976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,812 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:12,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643409868] [2022-03-15 20:12:12,812 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,814 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,819 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 43 transitions. [2022-03-15 20:12:12,819 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:12,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:12,861 INFO L87 Difference]: Start difference. First operand 237 states and 418 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,981 INFO L93 Difference]: Finished difference Result 232 states and 409 transitions. [2022-03-15 20:12:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-03-15 20:12:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,983 INFO L225 Difference]: With dead ends: 232 [2022-03-15 20:12:12,983 INFO L226 Difference]: Without dead ends: 228 [2022-03-15 20:12:12,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:12:12,984 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 32 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-03-15 20:12:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2022-03-15 20:12:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 209 states have (on average 1.7894736842105263) internal successors, (374), 211 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 374 transitions. [2022-03-15 20:12:12,988 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 374 transitions. Word has length 25 [2022-03-15 20:12:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,990 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 374 transitions. [2022-03-15 20:12:12,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 374 transitions. [2022-03-15 20:12:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 20:12:12,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,991 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] [2022-03-15 20:12:12,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:12:12,991 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1344768385, now seen corresponding path program 1 times [2022-03-15 20:12:12,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372813629] [2022-03-15 20:12:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:13,026 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:12:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:13,066 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:12:13,067 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:12:13,068 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-03-15 20:12:13,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (8 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-03-15 20:12:13,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-03-15 20:12:13,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-03-15 20:12:13,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-03-15 20:12:13,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:12:13,072 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:13,076 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:12:13,076 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:12:13,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:12:13 BasicIcfg [2022-03-15 20:12:13,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:12:13,127 INFO L158 Benchmark]: Toolchain (without parser) took 6555.10ms. Allocated memory was 208.7MB in the beginning and 274.7MB in the end (delta: 66.1MB). Free memory was 152.1MB in the beginning and 130.1MB in the end (delta: 22.0MB). Peak memory consumption was 89.0MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,128 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 208.7MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:12:13,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.72ms. Allocated memory was 208.7MB in the beginning and 274.7MB in the end (delta: 66.1MB). Free memory was 151.9MB in the beginning and 221.3MB in the end (delta: -69.4MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.13ms. Allocated memory is still 274.7MB. Free memory was 221.3MB in the beginning and 218.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,128 INFO L158 Benchmark]: Boogie Preprocessor took 36.39ms. Allocated memory is still 274.7MB. Free memory was 218.7MB in the beginning and 217.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,128 INFO L158 Benchmark]: RCFGBuilder took 410.76ms. Allocated memory is still 274.7MB. Free memory was 217.1MB in the beginning and 200.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,129 INFO L158 Benchmark]: TraceAbstraction took 5474.40ms. Allocated memory is still 274.7MB. Free memory was 200.3MB in the beginning and 130.1MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,129 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.11ms. Allocated memory is still 208.7MB. Free memory is still 171.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.72ms. Allocated memory was 208.7MB in the beginning and 274.7MB in the end (delta: 66.1MB). Free memory was 151.9MB in the beginning and 221.3MB in the end (delta: -69.4MB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.13ms. Allocated memory is still 274.7MB. Free memory was 221.3MB in the beginning and 218.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.39ms. Allocated memory is still 274.7MB. Free memory was 218.7MB in the beginning and 217.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 410.76ms. Allocated memory is still 274.7MB. Free memory was 217.1MB in the beginning and 200.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5474.40ms. Allocated memory is still 274.7MB. Free memory was 200.3MB in the beginning and 130.1MB in the end (delta: 70.3MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 118 PlacesBefore, 53 PlacesAfterwards, 114 TransitionsBefore, 49 TransitionsAfterwards, 2100 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 75 TotalNumberOfCompositions, 15937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3785, positive: 3135, positive conditional: 0, positive unconditional: 3135, negative: 650, negative conditional: 0, negative unconditional: 650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 878, positive: 811, positive conditional: 0, positive unconditional: 811, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3785, positive: 2324, positive conditional: 0, positive unconditional: 2324, negative: 583, negative conditional: 0, negative unconditional: 583, unknown: 878, unknown conditional: 0, unknown unconditional: 878] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; [L1224] 0 int *y; [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1234] 0 pthread_t id; [L1235] 0 x = malloc(sizeof(int)) [L1236] 0 y = malloc(sizeof(int)) [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, id={5:0}, m={3:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, x={-3:0}, y={-2:0}] [L1239] EXPR 0 *x VAL [arg={0:0}, id={5:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1239] EXPR 0 \read(*x) VAL [\read(*x)=102, arg={0:0}, id={5:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1239] 0 printf("%d\n",*x) [L1241] EXPR 0 *y VAL [arg={0:0}, id={5:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1241] EXPR 0 \read(*y) VAL [\read(*y)=101, arg={0:0}, id={5:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1228] EXPR 1 *x VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1228] 1 *x = 3 VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1229] EXPR 1 *y VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1229] 1 *y = 8 VAL [*y = 8=104, arg={0:0}, arg={0:0}, m={3:0}, x={-3:0}, y={-2:0}] [L1241] 0 printf("%d\n",*y) VAL [*y = 8=104, \read(*y)=101, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-3:0}, y={-2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *y = 8 [1229] * C: y = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1235] * C: *x = 3 [1228] * C: *x = 3 [1228] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 147 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 407 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1558 IncrementalHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 302 mSDtfsCounter, 1558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 546 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 20:12:13,198 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...