/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -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/09-regions_05-ptra_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 16:44:47,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 16:44:47,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 16:44:47,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 16:44:47,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 16:44:47,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 16:44:47,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 16:44:47,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 16:44:47,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 16:44:47,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 16:44:47,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 16:44:47,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 16:44:47,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 16:44:47,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 16:44:47,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 16:44:47,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 16:44:47,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 16:44:47,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 16:44:47,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 16:44:47,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 16:44:47,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 16:44:47,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 16:44:47,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 16:44:47,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 16:44:47,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 16:44:47,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 16:44:47,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 16:44:47,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 16:44:47,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 16:44:47,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 16:44:47,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 16:44:47,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 16:44:47,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 16:44:47,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 16:44:47,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 16:44:47,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 16:44:47,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 16:44:47,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 16:44:47,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 16:44:47,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 16:44:47,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 16:44:47,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-09 16:44:47,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 16:44:47,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 16:44:47,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 16:44:47,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 16:44:47,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 16:44:47,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 16:44:47,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 16:44:47,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 16:44:47,269 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 16:44:47,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 16:44:47,270 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 16:44:47,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 16:44:47,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:44:47,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 16:44:47,272 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 16:44:47,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 16:44:47,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 16:44:47,273 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 16:44:47,273 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 16:44:47,273 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-09 16:44:47,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 16:44:47,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 16:44:47,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 16:44:47,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 16:44:47,529 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 16:44:47,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2022-11-09 16:44:47,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114fe6b48/1a1bc96a8c694f1bb2c06ced979d2bd8/FLAGb904075ce [2022-11-09 16:44:48,132 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 16:44:48,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2022-11-09 16:44:48,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114fe6b48/1a1bc96a8c694f1bb2c06ced979d2bd8/FLAGb904075ce [2022-11-09 16:44:48,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114fe6b48/1a1bc96a8c694f1bb2c06ced979d2bd8 [2022-11-09 16:44:48,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 16:44:48,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 16:44:48,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 16:44:48,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 16:44:48,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 16:44:48,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:48" (1/1) ... [2022-11-09 16:44:48,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6268c655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:48, skipping insertion in model container [2022-11-09 16:44:48,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:48" (1/1) ... [2022-11-09 16:44:48,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 16:44:48,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 16:44:49,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:44:49,183 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 16:44:49,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:44:49,322 INFO L208 MainTranslator]: Completed translation [2022-11-09 16:44:49,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49 WrapperNode [2022-11-09 16:44:49,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 16:44:49,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 16:44:49,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 16:44:49,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 16:44:49,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,391 INFO L138 Inliner]: procedures = 369, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 212 [2022-11-09 16:44:49,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 16:44:49,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 16:44:49,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 16:44:49,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 16:44:49,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,426 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 16:44:49,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 16:44:49,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 16:44:49,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 16:44:49,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2022-11-09 16:44:49,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:44:49,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:44:49,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-09 16:44:49,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 16:44:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-09 16:44:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 16:44:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-09 16:44:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-09 16:44:49,500 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-09 16:44:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 16:44:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 16:44:49,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 16:44:49,501 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 16:44:49,664 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 16:44:49,666 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 16:44:49,986 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 16:44:49,994 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 16:44:49,994 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-09 16:44:49,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:49 BoogieIcfgContainer [2022-11-09 16:44:49,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 16:44:49,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 16:44:49,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 16:44:50,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 16:44:50,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:48" (1/3) ... [2022-11-09 16:44:50,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703d9989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:50, skipping insertion in model container [2022-11-09 16:44:50,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (2/3) ... [2022-11-09 16:44:50,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703d9989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:50, skipping insertion in model container [2022-11-09 16:44:50,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:49" (3/3) ... [2022-11-09 16:44:50,002 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2022-11-09 16:44:50,009 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 16:44:50,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 16:44:50,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-09 16:44:50,017 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 16:44:50,088 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-09 16:44:50,142 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:44:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 16:44:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:44:50,146 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 16:44:50,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-09 16:44:50,183 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 16:44:50,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-09 16:44:50,201 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@432a1d8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:44:50,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-09 16:44:50,327 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 753120510, now seen corresponding path program 1 times [2022-11-09 16:44:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:50,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455244396] [2022-11-09 16:44:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455244396] [2022-11-09 16:44:51,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455244396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:51,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:51,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637255652] [2022-11-09 16:44:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:51,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:51,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.6) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:51,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 16:44:51,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1018956669, now seen corresponding path program 1 times [2022-11-09 16:44:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:52,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938416926] [2022-11-09 16:44:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938416926] [2022-11-09 16:44:52,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938416926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:52,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:52,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855105933] [2022-11-09 16:44:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:52,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:52,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:52,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.2) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:52,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:52,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 16:44:52,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1776174535, now seen corresponding path program 1 times [2022-11-09 16:44:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:52,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574103430] [2022-11-09 16:44:52,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574103430] [2022-11-09 16:44:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574103430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:53,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:53,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 16:44:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740351760] [2022-11-09 16:44:53,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:53,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 16:44:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 16:44:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 16:44:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:53,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 83.5) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:53,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:53,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 16:44:53,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 657944235, now seen corresponding path program 1 times [2022-11-09 16:44:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:53,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565276810] [2022-11-09 16:44:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:53,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565276810] [2022-11-09 16:44:53,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565276810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:53,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:53,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870783569] [2022-11-09 16:44:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:53,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:53,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:53,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.6) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:53,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:53,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:53,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 16:44:54,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1162521955, now seen corresponding path program 1 times [2022-11-09 16:44:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510465194] [2022-11-09 16:44:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510465194] [2022-11-09 16:44:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510465194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:54,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789188712] [2022-11-09 16:44:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:54,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:54,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:54,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:54,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:54,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 16:44:54,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1244583202, now seen corresponding path program 1 times [2022-11-09 16:44:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018931020] [2022-11-09 16:44:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 16:44:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018931020] [2022-11-09 16:44:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018931020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:55,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:55,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907433834] [2022-11-09 16:44:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:55,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:55,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:55,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:55,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:55,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 38.4) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:55,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 16:44:55,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-11-09 16:44:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash 396913796, now seen corresponding path program 1 times [2022-11-09 16:44:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:55,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782721562] [2022-11-09 16:44:55,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 16:44:55,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 16:44:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 16:44:56,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-09 16:44:56,043 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 16:44:56,046 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-11-09 16:44:56,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-11-09 16:44:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2022-11-09 16:44:56,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2022-11-09 16:44:56,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-11-09 16:44:56,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-11-09 16:44:56,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-11-09 16:44:56,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 16:44:56,065 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-09 16:44:56,067 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-11-09 16:44:56,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-09 16:44:56,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 16:44:56,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:44:56 BasicIcfg [2022-11-09 16:44:56,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 16:44:56,229 INFO L158 Benchmark]: Toolchain (without parser) took 7669.29ms. Allocated memory was 181.4MB in the beginning and 339.7MB in the end (delta: 158.3MB). Free memory was 156.0MB in the beginning and 280.6MB in the end (delta: -124.6MB). Peak memory consumption was 207.6MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,230 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 181.4MB. Free memory was 140.9MB in the beginning and 140.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 16:44:56,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.59ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 155.8MB in the beginning and 166.4MB in the end (delta: -10.6MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.83ms. Allocated memory is still 221.2MB. Free memory was 166.4MB in the beginning and 162.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,231 INFO L158 Benchmark]: Boogie Preprocessor took 39.29ms. Allocated memory is still 221.2MB. Free memory was 162.7MB in the beginning and 159.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,231 INFO L158 Benchmark]: RCFGBuilder took 563.70ms. Allocated memory is still 221.2MB. Free memory was 159.6MB in the beginning and 131.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,231 INFO L158 Benchmark]: TraceAbstraction took 6231.65ms. Allocated memory was 221.2MB in the beginning and 339.7MB in the end (delta: 118.5MB). Free memory was 130.7MB in the beginning and 280.6MB in the end (delta: -149.9MB). Peak memory consumption was 143.7MB. Max. memory is 8.0GB. [2022-11-09 16:44:56,233 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.46ms. Allocated memory is still 181.4MB. Free memory was 140.9MB in the beginning and 140.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 761.59ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 155.8MB in the beginning and 166.4MB in the end (delta: -10.6MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.83ms. Allocated memory is still 221.2MB. Free memory was 166.4MB in the beginning and 162.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.29ms. Allocated memory is still 221.2MB. Free memory was 162.7MB in the beginning and 159.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.70ms. Allocated memory is still 221.2MB. Free memory was 159.6MB in the beginning and 131.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6231.65ms. Allocated memory was 221.2MB in the beginning and 339.7MB in the end (delta: 118.5MB). Free memory was 130.7MB in the beginning and 280.6MB in the end (delta: -149.9MB). Peak memory consumption was 143.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1804, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 73, negative conditional: 34, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1773, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 42, negative conditional: 3, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1773, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 42, negative conditional: 3, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 6, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 3, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 3, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1437, positive: 1393, positive conditional: 1, positive unconditional: 1392, negative: 44, negative conditional: 3, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1437, positive: 1364, positive conditional: 0, positive unconditional: 1364, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, positive: 29, positive conditional: 1, positive unconditional: 28, negative: 44, negative conditional: 3, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, positive: 40, positive conditional: 2, positive unconditional: 38, negative: 142, negative conditional: 9, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1780, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1437, unknown conditional: 4, unknown unconditional: 1433] , Statistics on independence cache: Total cache size (in pairs): 1437, Positive cache size: 1393, Positive conditional cache size: 1, Positive unconditional cache size: 1392, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 3, Maximal queried relation: 2, Independence queries for same thread: 31 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 202, Number of trivial persistent sets: 178, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1431, positive: 1392, positive conditional: 0, positive unconditional: 1392, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1804, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 73, negative conditional: 34, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1773, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 42, negative conditional: 3, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1773, positive: 1731, positive conditional: 339, positive unconditional: 1392, negative: 42, negative conditional: 3, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 6, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 3, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1780, positive: 1731, positive conditional: 1, positive unconditional: 1730, negative: 49, negative conditional: 3, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1437, positive: 1393, positive conditional: 1, positive unconditional: 1392, negative: 44, negative conditional: 3, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1437, positive: 1364, positive conditional: 0, positive unconditional: 1364, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, positive: 29, positive conditional: 1, positive unconditional: 28, negative: 44, negative conditional: 3, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, positive: 40, positive conditional: 2, positive unconditional: 38, negative: 142, negative conditional: 9, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1780, positive: 338, positive conditional: 0, positive unconditional: 338, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1437, unknown conditional: 4, unknown unconditional: 1433] , Statistics on independence cache: Total cache size (in pairs): 1437, Positive cache size: 1393, Positive conditional cache size: 1, Positive unconditional cache size: 1392, Negative cache size: 44, Negative conditional cache size: 3, Negative unconditional cache size: 41, Eliminated conditions: 3, Maximal queried relation: 2, Independence queries for same thread: 31 - DataRaceFoundResult [Line: 1242]: Data race detected Data race detected The following path leads to a data race: [L1224-L1227] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1232] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={2:0}, B={0:0}] [L1233] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}] [L1247] 0 pthread_t t1; VAL [A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, t1={13:0}] [L1248] 0 int *ip; VAL [A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, t1={13:0}] [L1249] 0 struct s *sp; VAL [A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, t1={13:0}] [L1250] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={13:0}] [L1251] CALL 0 init(p,9) [L1229] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={-2:0}, p={-2:0}, x=9] [L1230] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={-2:0}, p={-2:0}, x=9] [L1251] RET 0 init(p,9) [L1252] 0 A = malloc(sizeof(struct s)) VAL [A={11:0}, A = malloc(sizeof(struct s))=128, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, malloc(sizeof(struct s))={11:0}, p={-2:0}, t1={13:0}] [L1253] 0 init(A,3) VAL [A={11:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1253] CALL 0 init(A,3) [L1229] 0 p -> datum = x VAL [\old(x)=3, A={11:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={11:0}, p={11:0}, x=3] [L1230] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={11:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={11:0}, p={11:0}, x=3] [L1253] RET 0 init(A,3) [L1254] EXPR 0 A->next VAL [A={11:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1254] 0 A->next = p VAL [A={11:0}, A_mutex={2:0}, B={0:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1255] 0 B = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={2:0}, B={-3:0}, B = malloc(sizeof(struct s))=115, B_mutex={3:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={13:0}] [L1256] 0 init(B,5) VAL [A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1256] CALL 0 init(B,5) [L1229] 0 p -> datum = x VAL [\old(x)=5, A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-3:0}, x=5] [L1230] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-3:0}, x=5] [L1256] RET 0 init(B,5) [L1257] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1235] 1 int *ip; VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}] [L1236] 1 struct s *t, *sp = __VERIFIER_nondet_pointer(); VAL [__VERIFIER_nondet_pointer()={11:0}, A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, sp={11:0}] [L1237] 1 struct s *p = malloc(sizeof(struct s)); VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, malloc(sizeof(struct s))={-4:0}, p={-4:0}, sp={11:0}] [L1238] CALL 1 init(p,7) [L1229] 1 p -> datum = x VAL [\old(x)=5, \old(x)=7, A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-4:0}, p={-3:0}, p={-4:0}, x=7, x=5] [L1230] 1 p -> next = ((void *)0) VAL [\old(x)=5, \old(x)=7, A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-4:0}, p={-4:0}, p={-3:0}, x=7, x=5] [L1238] RET 1 init(p,7) [L1240] EXPR 1 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}] [L1240] 1 t = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}, t={-2:0}] [L1241] EXPR 1 A->next VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}, t={-2:0}] [L1241] 1 A->next = sp VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}, t={-2:0}] [L1242] 1 sp->next = t VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}, sp->next = t=101, t={-2:0}] [L1258] 0 ip = &p->datum VAL [A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-2:0}, p={-2:0}, t1={13:0}] [L1259] 0 sp = ((struct s *)((char *)(ip)-(unsigned long)(&((struct s *)0)->datum))) VAL [A={11:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-2:0}, p={-2:0}, sp={-2:0}, t1={13:0}] [L1261] EXPR 0 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-2:0}, p={-2:0}, sp={-2:0}, t1={13:0}] [L1261] 0 p = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-2:0}, p={-2:0}, sp={-2:0}, t1={13:0}] [L1242] 1 sp->next = t VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, sp={11:0}, sp->next = t=101, t={-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: p -> datum = x [1229] * C: A->next [1254] * C: A->next = sp [1241] * C: A->next = sp [1241] * C: A->next = sp [1241] * C: p -> next = ((void *)0) [1230] * C: init(B,5) [1256] * C: init(A,3) [1253] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] * C: t = A->next [1240] * C: A = malloc(sizeof(struct s)) [1252] * C: A->next = p [1254] * C: p -> datum = x [1229] * C: A->next = sp [1241] * C: A->next = p [1254] * C: A->next [1240] * C: p -> datum = x [1229] * C: t = A->next [1240] * C: A->next [1241] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] * C: p -> next = ((void *)0) [1230] * C: p -> datum = x [1229] * C: p = A->next [1261] * C: t = A->next [1240] * C: A->next [1261] * C: t = A->next [1240] * C: B = malloc(sizeof(struct s)) [1255] and C: sp->next = t [1242] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 323 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1232 NumberOfCodeBlocks, 1232 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 1463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 proved your program to be incorrect! [2022-11-09 16:44:56,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-09 16:44:56,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...