/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_25-malloc_race_cp.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:12:06,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:12:06,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:12:06,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:12:06,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:12:06,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:12:06,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:12:06,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:12:06,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:12:06,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:12:06,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:12:06,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:12:06,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:12:06,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:12:06,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:12:06,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:12:06,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:12:06,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:12:06,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:12:06,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:12:06,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:12:06,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:12:06,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:12:06,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:12:06,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:12:06,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:12:06,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:12:06,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:12:06,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:12:06,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:12:06,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:12:06,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:12:06,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:12:06,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:12:06,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:12:06,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:12:06,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:12:06,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:12:06,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:12:06,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:12:06,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:12:06,086 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:06,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:12:06,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:12:06,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:12:06,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:12:06,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:12:06,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:12:06,110 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:12:06,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:12:06,111 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:12:06,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:12:06,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:06,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:12:06,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:12:06,113 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,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:12:06,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:12:06,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:12:06,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:12:06,309 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:12:06,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_25-malloc_race_cp.i [2022-03-15 20:12:06,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6db92e2/b42fc59f7d0f4496bc5a1af8f6b00b65/FLAG3a471c26f [2022-03-15 20:12:06,840 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:12:06,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_25-malloc_race_cp.i [2022-03-15 20:12:06,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6db92e2/b42fc59f7d0f4496bc5a1af8f6b00b65/FLAG3a471c26f [2022-03-15 20:12:07,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6db92e2/b42fc59f7d0f4496bc5a1af8f6b00b65 [2022-03-15 20:12:07,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:12:07,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:12:07,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:07,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:12:07,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:12:07,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba40c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:12:07, skipping insertion in model container [2022-03-15 20:12:07,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:12:07" (1/1) ... [2022-03-15 20:12:07,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:12:07,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:12:07,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:07,734 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:12:07,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:12:07,844 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:12:07,844 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,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:12:07,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:07,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:12:07,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:12:07,851 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,878 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,897 INFO L137 Inliner]: procedures = 365, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2022-03-15 20:12:07,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:12:07,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:12:07,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:12:07,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:12:07,908 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,909 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,917 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,917 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,922 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,923 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,924 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,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:12:07,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:12:07,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:12:07,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:12:07,936 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,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:12:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:12:07,957 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,963 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,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:12:07,986 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:12:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:12:07,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:12:07,988 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:08,111 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:12:08,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:12:08,261 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:12:08,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:12:08,266 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:12:08,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:08 BoogieIcfgContainer [2022-03-15 20:12:08,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:12:08,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:12:08,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:12:08,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:12:08,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:12:07" (1/3) ... [2022-03-15 20:12:08,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766daa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:08, skipping insertion in model container [2022-03-15 20:12:08,272 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:08,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766daa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:12:08, skipping insertion in model container [2022-03-15 20:12:08,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:12:08" (3/3) ... [2022-03-15 20:12:08,273 INFO L111 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2022-03-15 20:12:08,276 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:12:08,276 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:12:08,276 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-03-15 20:12:08,276 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:12:08,311 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:08,311 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:08,311 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,312 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:08,312 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:08,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,312 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,312 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,314 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,315 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,316 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,317 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,322 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,322 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:12:08,324 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:12:08,351 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:12:08,355 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:08,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-03-15 20:12:08,364 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:12:08,370 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 116 transitions, 237 flow [2022-03-15 20:12:08,372 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 116 transitions, 237 flow [2022-03-15 20:12:08,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 116 transitions, 237 flow [2022-03-15 20:12:08,401 INFO L129 PetriNetUnfolder]: 0/115 cut-off events. [2022-03-15 20:12:08,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:12:08,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 115 events. 0/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:12:08,405 INFO L116 LiptonReduction]: Number of co-enabled transitions 1920 [2022-03-15 20:12:11,129 INFO L131 LiptonReduction]: Checked pairs total: 14248 [2022-03-15 20:12:11,130 INFO L133 LiptonReduction]: Total number of compositions: 88 [2022-03-15 20:12:11,136 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 45 transitions, 95 flow [2022-03-15 20:12:11,179 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 423 states, 401 states have (on average 1.9950124688279303) internal successors, (800), 422 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 423 states, 401 states have (on average 1.9950124688279303) internal successors, (800), 422 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have 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,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:12:11,185 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,186 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:12:11,186 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:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash 378, now seen corresponding path program 1 times [2022-03-15 20:12:11,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781766127] [2022-03-15 20:12:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,274 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,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781766127] [2022-03-15 20:12:11,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781766127] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:12:11,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708016874] [2022-03-15 20:12:11,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:12:11,282 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,284 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:12:11,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:12:11,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:12:11,301 INFO L87 Difference]: Start difference. First operand has 423 states, 401 states have (on average 1.9950124688279303) internal successors, (800), 422 states have internal predecessors, (800), 0 states have call successors, (0), 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:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,348 INFO L93 Difference]: Finished difference Result 400 states and 758 transitions. [2022-03-15 20:12:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:12:11,350 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:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,363 INFO L225 Difference]: With dead ends: 400 [2022-03-15 20:12:11,363 INFO L226 Difference]: Without dead ends: 400 [2022-03-15 20:12:11,364 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:11,367 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-03-15 20:12:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-03-15 20:12:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 385 states have (on average 1.9688311688311688) internal successors, (758), 399 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have 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,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 758 transitions. [2022-03-15 20:12:11,427 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 758 transitions. Word has length 1 [2022-03-15 20:12:11,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,427 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 758 transitions. [2022-03-15 20:12:11,427 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:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 758 transitions. [2022-03-15 20:12:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:12:11,428 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:12:11,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:12:11,428 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash 360919968, now seen corresponding path program 1 times [2022-03-15 20:12:11,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810107141] [2022-03-15 20:12:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,520 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,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810107141] [2022-03-15 20:12:11,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810107141] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:12:11,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409869731] [2022-03-15 20:12:11,521 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,522 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:12:11,522 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,522 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:12:11,523 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:12:11,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:11,524 INFO L87 Difference]: Start difference. First operand 400 states and 758 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:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,549 INFO L93 Difference]: Finished difference Result 361 states and 682 transitions. [2022-03-15 20:12:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:11,553 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:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,554 INFO L225 Difference]: With dead ends: 361 [2022-03-15 20:12:11,554 INFO L226 Difference]: Without dead ends: 361 [2022-03-15 20:12:11,555 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,555 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-03-15 20:12:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-03-15 20:12:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 353 states have (on average 1.9320113314447591) internal successors, (682), 360 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 682 transitions. [2022-03-15 20:12:11,562 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 682 transitions. Word has length 5 [2022-03-15 20:12:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,562 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 682 transitions. [2022-03-15 20:12:11,562 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:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 682 transitions. [2022-03-15 20:12:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:11,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:12:11,563 INFO L402 AbstractCegarLoop]: === Iteration 3 === 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,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1195763911, now seen corresponding path program 1 times [2022-03-15 20:12:11,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830766364] [2022-03-15 20:12:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,708 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,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830766364] [2022-03-15 20:12:11,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830766364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:11,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806348078] [2022-03-15 20:12:11,711 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,713 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:11,713 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:11,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,715 INFO L87 Difference]: Start difference. First operand 361 states and 682 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,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:11,877 INFO L93 Difference]: Finished difference Result 453 states and 859 transitions. [2022-03-15 20:12:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:11,878 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,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:11,880 INFO L225 Difference]: With dead ends: 453 [2022-03-15 20:12:11,881 INFO L226 Difference]: Without dead ends: 453 [2022-03-15 20:12:11,881 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,881 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 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.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:11,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-03-15 20:12:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 421. [2022-03-15 20:12:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 413 states have (on average 1.9467312348668282) internal successors, (804), 420 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have 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,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 804 transitions. [2022-03-15 20:12:11,890 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 804 transitions. Word has length 11 [2022-03-15 20:12:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:11,890 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 804 transitions. [2022-03-15 20:12:11,890 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,891 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 804 transitions. [2022-03-15 20:12:11,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:12:11,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:11,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:11,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:12:11,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-03-15 20:12:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash -307849516, now seen corresponding path program 1 times [2022-03-15 20:12:11,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:11,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260319650] [2022-03-15 20:12:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:11,962 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,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:11,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260319650] [2022-03-15 20:12:11,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260319650] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:11,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:11,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:11,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [14398744] [2022-03-15 20:12:11,963 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:11,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:11,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:12:11,964 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:11,965 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:11,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:11,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:11,965 INFO L87 Difference]: Start difference. First operand 421 states and 804 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:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,176 INFO L93 Difference]: Finished difference Result 711 states and 1340 transitions. [2022-03-15 20:12:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:12,176 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:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,179 INFO L225 Difference]: With dead ends: 711 [2022-03-15 20:12:12,179 INFO L226 Difference]: Without dead ends: 711 [2022-03-15 20:12:12,179 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,180 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-03-15 20:12:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 463. [2022-03-15 20:12:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 455 states have (on average 1.9428571428571428) internal successors, (884), 462 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have 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,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 884 transitions. [2022-03-15 20:12:12,190 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 884 transitions. Word has length 11 [2022-03-15 20:12:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,191 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 884 transitions. [2022-03-15 20:12:12,191 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:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 884 transitions. [2022-03-15 20:12:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 20:12:12,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,192 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:12,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:12:12,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === 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,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -619065924, now seen corresponding path program 1 times [2022-03-15 20:12:12,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232498372] [2022-03-15 20:12:12,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,249 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,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232498372] [2022-03-15 20:12:12,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232498372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:12:12,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825384311] [2022-03-15 20:12:12,250 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,251 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 62 transitions. [2022-03-15 20:12:12,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,354 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:12:12,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:12:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:12:12,355 INFO L87 Difference]: Start difference. First operand 463 states and 884 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,373 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2022-03-15 20:12:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:12:12,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,374 INFO L225 Difference]: With dead ends: 210 [2022-03-15 20:12:12,374 INFO L226 Difference]: Without dead ends: 210 [2022-03-15 20:12:12,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:12,376 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 20:12:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-15 20:12:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-03-15 20:12:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 204 states have (on average 1.7254901960784315) internal successors, (352), 209 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 352 transitions. [2022-03-15 20:12:12,380 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 352 transitions. Word has length 16 [2022-03-15 20:12:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,380 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 352 transitions. [2022-03-15 20:12:12,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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,381 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 352 transitions. [2022-03-15 20:12:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:12:12,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:12,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:12:12,384 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,385 INFO L85 PathProgramCache]: Analyzing trace with hash 48690771, now seen corresponding path program 1 times [2022-03-15 20:12:12,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473106589] [2022-03-15 20:12:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,481 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,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473106589] [2022-03-15 20:12:12,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473106589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:12,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984426499] [2022-03-15 20:12:12,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,484 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,485 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2022-03-15 20:12:12,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,486 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:12,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:12,487 INFO L87 Difference]: Start difference. First operand 210 states and 352 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,549 INFO L93 Difference]: Finished difference Result 231 states and 390 transitions. [2022-03-15 20:12:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:12,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-03-15 20:12:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,550 INFO L225 Difference]: With dead ends: 231 [2022-03-15 20:12:12,550 INFO L226 Difference]: Without dead ends: 216 [2022-03-15 20:12:12,551 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,553 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-03-15 20:12:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-03-15 20:12:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.7061611374407584) internal successors, (360), 215 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have 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,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 360 transitions. [2022-03-15 20:12:12,562 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 360 transitions. Word has length 17 [2022-03-15 20:12:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,562 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 360 transitions. [2022-03-15 20:12:12,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have 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,562 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 360 transitions. [2022-03-15 20:12:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 20:12:12,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:12,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:12:12,563 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1163397500, now seen corresponding path program 1 times [2022-03-15 20:12:12,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786027993] [2022-03-15 20:12:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,652 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,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786027993] [2022-03-15 20:12:12,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786027993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:12:12,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071743707] [2022-03-15 20:12:12,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,656 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2022-03-15 20:12:12,656 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:12,657 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:12,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:12:12,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:12:12,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:12:12,661 INFO L87 Difference]: Start difference. First operand 216 states and 360 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:12,818 INFO L93 Difference]: Finished difference Result 273 states and 456 transitions. [2022-03-15 20:12:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:12:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 20:12:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:12,820 INFO L225 Difference]: With dead ends: 273 [2022-03-15 20:12:12,820 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 20:12:12,820 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,820 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:12,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 47 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 20:12:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2022-03-15 20:12:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.8026905829596414) internal successors, (402), 227 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have 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,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 402 transitions. [2022-03-15 20:12:12,825 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 402 transitions. Word has length 18 [2022-03-15 20:12:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:12,825 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 402 transitions. [2022-03-15 20:12:12,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:12:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 402 transitions. [2022-03-15 20:12:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:12:12,826 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:12,826 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] [2022-03-15 20:12:12,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:12:12,826 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:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1615449340, now seen corresponding path program 1 times [2022-03-15 20:12:12,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:12,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926388645] [2022-03-15 20:12:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:12,920 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,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:12,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926388645] [2022-03-15 20:12:12,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926388645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:12,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:12,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:12,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317673806] [2022-03-15 20:12:12,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:12,923 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:12,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 61 transitions. [2022-03-15 20:12:12,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:13,182 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:13,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:13,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:13,184 INFO L87 Difference]: Start difference. First operand 228 states and 402 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:13,357 INFO L93 Difference]: Finished difference Result 221 states and 383 transitions. [2022-03-15 20:12:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 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 23 [2022-03-15 20:12:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:13,358 INFO L225 Difference]: With dead ends: 221 [2022-03-15 20:12:13,358 INFO L226 Difference]: Without dead ends: 221 [2022-03-15 20:12:13,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:13,359 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:13,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:12:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-03-15 20:12:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2022-03-15 20:12:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.7634408602150538) internal successors, (328), 189 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 328 transitions. [2022-03-15 20:12:13,363 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 328 transitions. Word has length 23 [2022-03-15 20:12:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:13,363 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 328 transitions. [2022-03-15 20:12:13,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have 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:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 328 transitions. [2022-03-15 20:12:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:12:13,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:13,364 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] [2022-03-15 20:12:13,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:12:13,364 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 916894801, now seen corresponding path program 1 times [2022-03-15 20:12:13,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:13,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740199516] [2022-03-15 20:12:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:12:13,446 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:13,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:12:13,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740199516] [2022-03-15 20:12:13,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740199516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:12:13,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:12:13,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 20:12:13,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [199352719] [2022-03-15 20:12:13,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:12:13,449 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:12:13,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 29 transitions. [2022-03-15 20:12:13,454 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:12:13,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:12:13,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:12:13,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:12:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:12:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:13,465 INFO L87 Difference]: Start difference. First operand 190 states and 328 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:12:13,567 INFO L93 Difference]: Finished difference Result 185 states and 319 transitions. [2022-03-15 20:12:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:12:13,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-03-15 20:12:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:12:13,569 INFO L225 Difference]: With dead ends: 185 [2022-03-15 20:12:13,569 INFO L226 Difference]: Without dead ends: 181 [2022-03-15 20:12:13,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:12:13,570 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:12:13,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 19 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:12:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-03-15 20:12:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2022-03-15 20:12:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.7530864197530864) internal successors, (284), 164 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have 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:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 284 transitions. [2022-03-15 20:12:13,573 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 284 transitions. Word has length 23 [2022-03-15 20:12:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:12:13,574 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 284 transitions. [2022-03-15 20:12:13,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 284 transitions. [2022-03-15 20:12:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 20:12:13,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:12:13,574 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] [2022-03-15 20:12:13,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:12:13,575 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:12:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash -423622422, now seen corresponding path program 1 times [2022-03-15 20:12:13,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:12:13,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773773319] [2022-03-15 20:12:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:12:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:12:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:13,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:12:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:12:13,626 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:12:13,626 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:12:13,627 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2022-03-15 20:12:13,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (8 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2022-03-15 20:12:13,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2022-03-15 20:12:13,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:12:13,631 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:12:13,634 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:12:13,634 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:12:13,659 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,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:12:13,659 INFO L158 Benchmark]: Toolchain (without parser) took 6322.09ms. Allocated memory was 170.9MB in the beginning and 247.5MB in the end (delta: 76.5MB). Free memory was 117.0MB in the beginning and 154.3MB in the end (delta: -37.3MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory was 136.5MB in the beginning and 136.4MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.13ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 116.9MB in the beginning and 154.4MB in the end (delta: -37.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 205.5MB. Free memory was 154.4MB in the beginning and 151.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: RCFGBuilder took 341.00ms. Allocated memory is still 205.5MB. Free memory was 149.6MB in the beginning and 134.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,660 INFO L158 Benchmark]: TraceAbstraction took 5390.38ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 134.4MB in the beginning and 154.3MB in the end (delta: -19.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2022-03-15 20:12:13,661 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.12ms. Allocated memory is still 170.9MB. Free memory was 136.5MB in the beginning and 136.4MB in the end (delta: 90.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.13ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 116.9MB in the beginning and 154.4MB in the end (delta: -37.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 205.5MB. Free memory was 154.4MB in the beginning and 151.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 205.5MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 341.00ms. Allocated memory is still 205.5MB. Free memory was 149.6MB in the beginning and 134.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5390.38ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 134.4MB in the beginning and 154.3MB in the end (delta: -19.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 120 PlacesBefore, 49 PlacesAfterwards, 116 TransitionsBefore, 45 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 8 FixpointIterations, 62 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 88 TotalNumberOfCompositions, 14248 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2823, positive: 2176, positive conditional: 0, positive unconditional: 2176, negative: 647, negative conditional: 0, negative unconditional: 647, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 815, positive: 748, positive conditional: 0, positive unconditional: 748, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2823, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 580, negative conditional: 0, negative unconditional: 580, unknown: 815, unknown conditional: 0, unknown unconditional: 815] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - 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: 1243]: 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 int *z; [L1236] 0 x = malloc(sizeof(int)) [L1237] 0 y = malloc(sizeof(int)) [L1238] 0 z = y [L1239] 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))=0, x={-1:0}, y={-2:0}, z={-2:0}] [L1241] EXPR 0 *x VAL [arg={0:0}, id={5:0}, m={3:0}, x={-1:0}, y={-2:0}, z={-2:0}] [L1241] EXPR 0 \read(*x) VAL [\read(*x)=101, arg={0:0}, id={5:0}, m={3:0}, x={-1:0}, y={-2:0}, z={-2:0}] [L1241] 0 printf("%d\n",*x) [L1243] EXPR 0 \read(*z) VAL [\read(*z)=104, arg={0:0}, id={5:0}, m={3:0}, x={-1:0}, y={-2:0}, z={-2:0}] [L1228] EXPR 1 *x VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-1:0}, y={-2:0}] [L1228] 1 *x = 3 [L1229] EXPR 1 *y VAL [arg={0:0}, arg={0:0}, m={3:0}, x={-1:0}, y={-2:0}] [L1229] 1 *y = 8 VAL [*y = 8=103, arg={0:0}, arg={0:0}, m={3:0}, x={-1:0}, y={-2:0}] [L1243] 0 printf("%d\n",*z) VAL [*y = 8=103, \read(*z)=104, arg={0:0}, arg={0:0}, id={5:0}, m={3:0}, x={-1:0}, y={-2:0}, z={-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: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1236] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] and C: printf("%d\n",*z) [1243] - 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: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: 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: 1241]: 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 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, 149 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 285 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1510 IncrementalHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 197 mSDtfsCounter, 1510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 9 MinimizatonAttempts, 335 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...