/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 18:20:56,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 18:20:56,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 18:20:56,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 18:20:56,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 18:20:56,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 18:20:56,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 18:20:56,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 18:20:56,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 18:20:56,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 18:20:56,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 18:20:56,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 18:20:56,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 18:20:56,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 18:20:56,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 18:20:56,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 18:20:56,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 18:20:56,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 18:20:56,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 18:20:56,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 18:20:56,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 18:20:56,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 18:20:56,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 18:20:56,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 18:20:56,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 18:20:56,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 18:20:56,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 18:20:56,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 18:20:56,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 18:20:56,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 18:20:56,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 18:20:56,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 18:20:56,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 18:20:56,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 18:20:56,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 18:20:56,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 18:20:56,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 18:20:56,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 18:20:56,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 18:20:56,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 18:20:56,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 18:20:56,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 18:20:56,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 18:20:56,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 18:20:56,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 18:20:56,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 18:20:56,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 18:20:56,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 18:20:56,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 18:20:56,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 18:20:56,966 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 18:20:56,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 18:20:56,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 18:20:56,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 18:20:56,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 18:20:56,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 18:20:56,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 18:20:56,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 18:20:56,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 18:20:56,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 18:20:56,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:20:56,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 18:20:56,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 18:20:56,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-03 18:20:57,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 18:20:57,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 18:20:57,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 18:20:57,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 18:20:57,242 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 18:20:57,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2022-03-03 18:20:57,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ee17f5/50ac0b6eaf524fbbb4e98b81244bdb11/FLAG3adb3e18d [2022-03-03 18:20:57,842 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 18:20:57,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.i [2022-03-03 18:20:57,863 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ee17f5/50ac0b6eaf524fbbb4e98b81244bdb11/FLAG3adb3e18d [2022-03-03 18:20:58,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a5ee17f5/50ac0b6eaf524fbbb4e98b81244bdb11 [2022-03-03 18:20:58,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 18:20:58,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 18:20:58,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 18:20:58,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 18:20:58,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 18:20:58,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673a59fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58, skipping insertion in model container [2022-03-03 18:20:58,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 18:20:58,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 18:20:58,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:20:58,787 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 18:20:58,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 18:20:58,871 INFO L208 MainTranslator]: Completed translation [2022-03-03 18:20:58,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58 WrapperNode [2022-03-03 18:20:58,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 18:20:58,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 18:20:58,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 18:20:58,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 18:20:58,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,941 INFO L137 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-03-03 18:20:58,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 18:20:58,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 18:20:58,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 18:20:58,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 18:20:58,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 18:20:58,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 18:20:58,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 18:20:58,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 18:20:58,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (1/1) ... [2022-03-03 18:20:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 18:20:59,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 18:20:59,017 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-03 18:20:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-03 18:20:59,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 18:20:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 18:20:59,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 18:20:59,064 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 18:20:59,053 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-03 18:20:59,161 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 18:20:59,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 18:20:59,439 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 18:20:59,449 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 18:20:59,450 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-03 18:20:59,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:20:59 BoogieIcfgContainer [2022-03-03 18:20:59,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 18:20:59,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 18:20:59,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 18:20:59,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 18:20:59,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:20:58" (1/3) ... [2022-03-03 18:20:59,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c7a7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:20:59, skipping insertion in model container [2022-03-03 18:20:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:20:58" (2/3) ... [2022-03-03 18:20:59,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c7a7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:20:59, skipping insertion in model container [2022-03-03 18:20:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 06:20:59" (3/3) ... [2022-03-03 18:20:59,461 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2022-03-03 18:20:59,466 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 18:20:59,467 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 18:20:59,467 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-03-03 18:20:59,467 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,508 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,509 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,509 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,509 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,510 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,512 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,513 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,514 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,514 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,514 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,514 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,514 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,515 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,515 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,517 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,518 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,518 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,518 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,519 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,519 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,519 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,520 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,520 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,521 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,522 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,523 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,529 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,529 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,529 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,530 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,530 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,530 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 18:20:59,541 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-03-03 18:20:59,591 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 18:20:59,599 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 18:20:59,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-03-03 18:20:59,615 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 109 transitions, 226 flow [2022-03-03 18:20:59,697 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 962 states, 940 states have (on average 1.9382978723404256) internal successors, (1822), 961 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:20:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 962 states, 940 states have (on average 1.9382978723404256) internal successors, (1822), 961 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:20:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-03 18:20:59,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:20:59,710 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] [2022-03-03 18:20:59,711 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:20:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:20:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash -757145905, now seen corresponding path program 1 times [2022-03-03 18:20:59,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:20:59,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883791403] [2022-03-03 18:20:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:20:59,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:20:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:20:59,913 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-03 18:20:59,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:20:59,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883791403] [2022-03-03 18:20:59,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883791403] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:20:59,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:20:59,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:20:59,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082438248] [2022-03-03 18:20:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:20:59,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:20:59,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:20:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:20:59,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:20:59,958 INFO L87 Difference]: Start difference. First operand has 962 states, 940 states have (on average 1.9382978723404256) internal successors, (1822), 961 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:00,030 INFO L93 Difference]: Finished difference Result 961 states and 1821 transitions. [2022-03-03 18:21:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-03 18:21:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:00,058 INFO L225 Difference]: With dead ends: 961 [2022-03-03 18:21:00,058 INFO L226 Difference]: Without dead ends: 961 [2022-03-03 18:21:00,060 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-03 18:21:00,063 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:00,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:21:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-03-03 18:21:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2022-03-03 18:21:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 940 states have (on average 1.9372340425531915) internal successors, (1821), 960 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1821 transitions. [2022-03-03 18:21:00,178 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1821 transitions. Word has length 26 [2022-03-03 18:21:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:00,179 INFO L470 AbstractCegarLoop]: Abstraction has 961 states and 1821 transitions. [2022-03-03 18:21:00,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1821 transitions. [2022-03-03 18:21:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-03 18:21:00,179 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:00,180 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] [2022-03-03 18:21:00,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 18:21:00,180 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1767735309, now seen corresponding path program 1 times [2022-03-03 18:21:00,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:00,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542986055] [2022-03-03 18:21:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:00,245 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-03 18:21:00,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:00,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542986055] [2022-03-03 18:21:00,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542986055] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:00,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:00,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:00,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059042315] [2022-03-03 18:21:00,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:00,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:00,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:00,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:00,248 INFO L87 Difference]: Start difference. First operand 961 states and 1821 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:00,264 INFO L93 Difference]: Finished difference Result 931 states and 1763 transitions. [2022-03-03 18:21:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:00,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-03 18:21:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:00,269 INFO L225 Difference]: With dead ends: 931 [2022-03-03 18:21:00,269 INFO L226 Difference]: Without dead ends: 931 [2022-03-03 18:21:00,270 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-03 18:21:00,271 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 69 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:00,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:21:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-03-03 18:21:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2022-03-03 18:21:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 915 states have (on average 1.926775956284153) internal successors, (1763), 930 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1763 transitions. [2022-03-03 18:21:00,300 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1763 transitions. Word has length 28 [2022-03-03 18:21:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:00,301 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1763 transitions. [2022-03-03 18:21:00,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1763 transitions. [2022-03-03 18:21:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-03 18:21:00,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:00,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:00,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 18:21:00,303 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:00,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2128740494, now seen corresponding path program 1 times [2022-03-03 18:21:00,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:00,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114025213] [2022-03-03 18:21:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:00,367 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-03 18:21:00,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:00,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114025213] [2022-03-03 18:21:00,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114025213] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:00,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:00,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:00,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691603054] [2022-03-03 18:21:00,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:00,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:00,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:00,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:00,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:00,370 INFO L87 Difference]: Start difference. First operand 931 states and 1763 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:00,386 INFO L93 Difference]: Finished difference Result 930 states and 1762 transitions. [2022-03-03 18:21:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:00,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-03 18:21:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:00,390 INFO L225 Difference]: With dead ends: 930 [2022-03-03 18:21:00,390 INFO L226 Difference]: Without dead ends: 930 [2022-03-03 18:21:00,391 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-03 18:21:00,392 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:00,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:21:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-03-03 18:21:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2022-03-03 18:21:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 915 states have (on average 1.9256830601092896) internal successors, (1762), 929 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1762 transitions. [2022-03-03 18:21:00,429 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1762 transitions. Word has length 32 [2022-03-03 18:21:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:00,430 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1762 transitions. [2022-03-03 18:21:00,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1762 transitions. [2022-03-03 18:21:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-03 18:21:00,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:00,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:00,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 18:21:00,434 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -159277023, now seen corresponding path program 1 times [2022-03-03 18:21:00,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:00,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445728759] [2022-03-03 18:21:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:00,515 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-03 18:21:00,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:00,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445728759] [2022-03-03 18:21:00,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445728759] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:00,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:00,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 18:21:00,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616617169] [2022-03-03 18:21:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:00,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 18:21:00,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 18:21:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 18:21:00,518 INFO L87 Difference]: Start difference. First operand 930 states and 1762 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:00,541 INFO L93 Difference]: Finished difference Result 899 states and 1701 transitions. [2022-03-03 18:21:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 18:21:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-03-03 18:21:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:00,546 INFO L225 Difference]: With dead ends: 899 [2022-03-03 18:21:00,546 INFO L226 Difference]: Without dead ends: 899 [2022-03-03 18:21:00,546 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-03 18:21:00,547 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:00,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 18:21:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-03-03 18:21:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-03-03 18:21:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 888 states have (on average 1.9155405405405406) internal successors, (1701), 898 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1701 transitions. [2022-03-03 18:21:00,570 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1701 transitions. Word has length 43 [2022-03-03 18:21:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:00,571 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1701 transitions. [2022-03-03 18:21:00,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1701 transitions. [2022-03-03 18:21:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-03 18:21:00,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:00,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 18:21:00,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash -563524932, now seen corresponding path program 1 times [2022-03-03 18:21:00,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:00,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918584368] [2022-03-03 18:21:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:00,767 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-03 18:21:00,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:00,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918584368] [2022-03-03 18:21:00,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918584368] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:00,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:00,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:00,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330525983] [2022-03-03 18:21:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:00,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:00,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:00,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:00,772 INFO L87 Difference]: Start difference. First operand 899 states and 1701 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:00,981 INFO L93 Difference]: Finished difference Result 979 states and 1853 transitions. [2022-03-03 18:21:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:00,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-03-03 18:21:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:00,987 INFO L225 Difference]: With dead ends: 979 [2022-03-03 18:21:00,987 INFO L226 Difference]: Without dead ends: 979 [2022-03-03 18:21:00,987 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-03 18:21:00,992 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 84 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:00,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 326 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:21:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-03-03 18:21:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 931. [2022-03-03 18:21:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 921 states have (on average 1.9120521172638436) internal successors, (1761), 930 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1761 transitions. [2022-03-03 18:21:01,018 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1761 transitions. Word has length 48 [2022-03-03 18:21:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:01,019 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1761 transitions. [2022-03-03 18:21:01,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1761 transitions. [2022-03-03 18:21:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-03 18:21:01,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:01,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:01,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 18:21:01,024 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -932716891, now seen corresponding path program 1 times [2022-03-03 18:21:01,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:01,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573816755] [2022-03-03 18:21:01,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:01,162 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-03 18:21:01,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:01,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573816755] [2022-03-03 18:21:01,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573816755] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:01,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:01,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:01,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873043573] [2022-03-03 18:21:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:01,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:01,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:01,165 INFO L87 Difference]: Start difference. First operand 931 states and 1761 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:01,356 INFO L93 Difference]: Finished difference Result 1045 states and 1981 transitions. [2022-03-03 18:21:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-03-03 18:21:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:01,361 INFO L225 Difference]: With dead ends: 1045 [2022-03-03 18:21:01,361 INFO L226 Difference]: Without dead ends: 1045 [2022-03-03 18:21:01,362 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-03 18:21:01,362 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 84 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:01,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 232 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:21:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2022-03-03 18:21:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 981. [2022-03-03 18:21:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 971 states have (on average 1.9124613800205974) internal successors, (1857), 980 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1857 transitions. [2022-03-03 18:21:01,388 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1857 transitions. Word has length 49 [2022-03-03 18:21:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:01,389 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1857 transitions. [2022-03-03 18:21:01,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1857 transitions. [2022-03-03 18:21:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-03 18:21:01,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:01,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:01,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 18:21:01,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1509049556, now seen corresponding path program 1 times [2022-03-03 18:21:01,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:01,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952518642] [2022-03-03 18:21:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:01,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:01,504 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-03 18:21:01,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:01,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952518642] [2022-03-03 18:21:01,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952518642] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:01,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:01,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:01,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478119272] [2022-03-03 18:21:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:01,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:01,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:01,507 INFO L87 Difference]: Start difference. First operand 981 states and 1857 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:01,736 INFO L93 Difference]: Finished difference Result 1129 states and 2146 transitions. [2022-03-03 18:21:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:01,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-03-03 18:21:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:01,745 INFO L225 Difference]: With dead ends: 1129 [2022-03-03 18:21:01,745 INFO L226 Difference]: Without dead ends: 1129 [2022-03-03 18:21:01,745 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-03 18:21:01,746 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:01,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 393 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-03 18:21:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-03-03 18:21:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1057. [2022-03-03 18:21:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1047 states have (on average 1.914995224450812) internal successors, (2005), 1056 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2005 transitions. [2022-03-03 18:21:01,770 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2005 transitions. Word has length 56 [2022-03-03 18:21:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:01,770 INFO L470 AbstractCegarLoop]: Abstraction has 1057 states and 2005 transitions. [2022-03-03 18:21:01,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2005 transitions. [2022-03-03 18:21:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-03 18:21:01,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:01,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:01,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 18:21:01,772 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash 902304810, now seen corresponding path program 1 times [2022-03-03 18:21:01,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:01,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229938888] [2022-03-03 18:21:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 18:21:01,862 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-03 18:21:01,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 18:21:01,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229938888] [2022-03-03 18:21:01,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229938888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 18:21:01,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 18:21:01,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-03 18:21:01,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054079561] [2022-03-03 18:21:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 18:21:01,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 18:21:01,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 18:21:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 18:21:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-03 18:21:01,869 INFO L87 Difference]: Start difference. First operand 1057 states and 2005 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 18:21:02,024 INFO L93 Difference]: Finished difference Result 1239 states and 2361 transitions. [2022-03-03 18:21:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 18:21:02,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-03-03 18:21:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 18:21:02,029 INFO L225 Difference]: With dead ends: 1239 [2022-03-03 18:21:02,030 INFO L226 Difference]: Without dead ends: 1220 [2022-03-03 18:21:02,030 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-03 18:21:02,030 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 18:21:02,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 231 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 18:21:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-03-03 18:21:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1130. [2022-03-03 18:21:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1120 states have (on average 1.9160714285714286) internal successors, (2146), 1129 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2146 transitions. [2022-03-03 18:21:02,064 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2146 transitions. Word has length 57 [2022-03-03 18:21:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 18:21:02,064 INFO L470 AbstractCegarLoop]: Abstraction has 1130 states and 2146 transitions. [2022-03-03 18:21:02,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 18:21:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2146 transitions. [2022-03-03 18:21:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-03 18:21:02,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 18:21:02,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 18:21:02,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 18:21:02,066 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-03-03 18:21:02,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 18:21:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash -160734584, now seen corresponding path program 1 times [2022-03-03 18:21:02,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 18:21:02,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885112193] [2022-03-03 18:21:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 18:21:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 18:21:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 18:21:02,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-03 18:21:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 18:21:02,156 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-03 18:21:02,156 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-03 18:21:02,157 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2022-03-03 18:21:02,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-03-03 18:21:02,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-03-03 18:21:02,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-03-03 18:21:02,160 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-03-03 18:21:02,161 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-03-03 18:21:02,161 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-03-03 18:21:02,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-03 18:21:02,163 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 18:21:02,168 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 18:21:02,168 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 18:21:02,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:21:02 BasicIcfg [2022-03-03 18:21:02,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 18:21:02,220 INFO L158 Benchmark]: Toolchain (without parser) took 3909.77ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 125.4MB in the beginning and 121.6MB in the end (delta: 3.8MB). Peak memory consumption was 49.5MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,221 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 184.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 18:21:02,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.89ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 125.3MB in the beginning and 194.3MB in the end (delta: -69.0MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 229.6MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,221 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory is still 229.6MB. Free memory was 192.2MB in the beginning and 190.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,222 INFO L158 Benchmark]: RCFGBuilder took 470.30ms. Allocated memory is still 229.6MB. Free memory was 190.6MB in the beginning and 176.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,222 INFO L158 Benchmark]: TraceAbstraction took 2766.99ms. Allocated memory is still 229.6MB. Free memory was 175.4MB in the beginning and 121.6MB in the end (delta: 53.9MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. [2022-03-03 18:21:02,223 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.40ms. Allocated memory is still 184.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.89ms. Allocated memory was 184.5MB in the beginning and 229.6MB in the end (delta: 45.1MB). Free memory was 125.3MB in the beginning and 194.3MB in the end (delta: -69.0MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 229.6MB. Free memory was 194.3MB in the beginning and 192.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.62ms. Allocated memory is still 229.6MB. Free memory was 192.2MB in the beginning and 190.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.30ms. Allocated memory is still 229.6MB. Free memory was 190.6MB in the beginning and 176.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2766.99ms. Allocated memory is still 229.6MB. Free memory was 175.4MB in the beginning and 121.6MB in the end (delta: 53.9MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 694]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; VAL [g={1:0}] [L680] 0 int *g1; VAL [g={1:0}, g1={0:0}] [L681] 0 int *g2; VAL [g={1:0}, g1={0:0}, g2={0:0}] [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [g={1:0}, g1={0:0}, g2={0:0}, mutex={2:0}] [L690] 0 pthread_t id; VAL [g={1:0}, g1={0:0}, g2={0:0}, id={5:0}, mutex={2:0}] [L691] 0 int x; VAL [g={1:0}, g1={0:0}, g2={0:0}, id={5:0}, mutex={2:0}] [L692] EXPR 0 g2 = &g VAL [g={1:0}, g1={0:0}, g2={1:0}, g2 = &g=26, id={5:0}, mutex={2:0}] [L692] 0 g1 = g2 = &g VAL [g={1:0}, g1={1:0}, g1 = g2 = &g=27, g2={1:0}, g2 = &g=26, id={5:0}, mutex={2:0}] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L694] EXPR 0 *g2 VAL [arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L694] EXPR 0 \read(*g2) VAL [\read(*g2)=0, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\read(*g2)=0, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L685] EXPR 1 *g1 VAL [arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [(*g2)++=0, (*g2)++=25, \read(*g2)=0, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={2:0}] [L685] EXPR 1 *g1 VAL [arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L685] EXPR 1 \read(*g1) VAL [\read(*g1)=1, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\read(*g1)=1, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [(*g2)++=0, (*g2)++=25, \read(*g1)=1, \read(*g2)=0, arg={0:0}, arg={0:0}, g={1:0}, g1={1:0}, g2={1:0}, id={5:0}, mutex={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: g1 = g2 = &g [692] * C: (*g2)++ [694] * C: g2 = &g [692] * C: (*g1)++ [685] * C: (*g2)++ [694] * C: *g1 [685] * C: (*g2)++ [694] * C: (*g2)++ [694] * C: *g2 [694] * C: g1 = g2 = &g [692] and C: (*g2)++ [694] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: 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, 140 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 456 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 1855 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 885 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 979 mSDtfsCounter, 852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1130occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 274 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-03 18:21:02,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...