/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_03-list2_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 16:44:39,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 16:44:39,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 16:44:39,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 16:44:39,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 16:44:39,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 16:44:39,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 16:44:39,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 16:44:39,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 16:44:39,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 16:44:39,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 16:44:39,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 16:44:39,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 16:44:39,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 16:44:39,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 16:44:39,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 16:44:39,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 16:44:39,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 16:44:39,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 16:44:39,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 16:44:39,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 16:44:39,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 16:44:39,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 16:44:39,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 16:44:39,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 16:44:39,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 16:44:39,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 16:44:39,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 16:44:39,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 16:44:39,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 16:44:39,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 16:44:39,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 16:44:39,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 16:44:39,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 16:44:39,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 16:44:39,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 16:44:39,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 16:44:39,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 16:44:39,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 16:44:39,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 16:44:39,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 16:44:39,806 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:39,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 16:44:39,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 16:44:39,830 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 16:44:39,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 16:44:39,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 16:44:39,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 16:44:39,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 16:44:39,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 16:44:39,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 16:44:39,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 16:44:39,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:44:39,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 16:44:39,833 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 16:44:39,833 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:39,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 16:44:39,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 16:44:39,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 16:44:39,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 16:44:39,998 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 16:44:39,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-11-09 16:44:40,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/494a3eadf/50da0d9170dc45e3a2f826ce8e1e1c56/FLAG12a7826b2 [2022-11-09 16:44:40,480 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 16:44:40,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.i [2022-11-09 16:44:40,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/494a3eadf/50da0d9170dc45e3a2f826ce8e1e1c56/FLAG12a7826b2 [2022-11-09 16:44:40,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/494a3eadf/50da0d9170dc45e3a2f826ce8e1e1c56 [2022-11-09 16:44:40,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 16:44:40,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 16:44:40,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 16:44:40,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 16:44:40,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 16:44:40,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:40" (1/1) ... [2022-11-09 16:44:40,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d1cec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:40, skipping insertion in model container [2022-11-09 16:44:40,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:40" (1/1) ... [2022-11-09 16:44:40,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 16:44:40,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 16:44:40,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:44:40,926 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 16:44:40,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 16:44:40,996 INFO L208 MainTranslator]: Completed translation [2022-11-09 16:44:40,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:40 WrapperNode [2022-11-09 16:44:40,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 16:44:40,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 16:44:40,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 16:44:40,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 16:44:41,002 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:40" (1/1) ... [2022-11-09 16:44:41,020 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:40" (1/1) ... [2022-11-09 16:44:41,055 INFO L138 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2022-11-09 16:44:41,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 16:44:41,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 16:44:41,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 16:44:41,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 16:44:41,068 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:40" (1/1) ... [2022-11-09 16:44:41,069 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:40" (1/1) ... [2022-11-09 16:44:41,072 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:40" (1/1) ... [2022-11-09 16:44:41,073 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:40" (1/1) ... [2022-11-09 16:44:41,086 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:40" (1/1) ... [2022-11-09 16:44:41,088 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:40" (1/1) ... [2022-11-09 16:44:41,089 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:40" (1/1) ... [2022-11-09 16:44:41,090 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:40" (1/1) ... [2022-11-09 16:44:41,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 16:44:41,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 16:44:41,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 16:44:41,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 16:44:41,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:40" (1/1) ... [2022-11-09 16:44:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 16:44:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:44:41,126 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:41,128 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:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 16:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-09 16:44:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-09 16:44:41,150 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 16:44:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 16:44:41,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 16:44:41,151 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:41,300 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 16:44:41,302 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 16:44:41,673 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 16:44:41,685 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 16:44:41,686 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-09 16:44:41,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:41 BoogieIcfgContainer [2022-11-09 16:44:41,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 16:44:41,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 16:44:41,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 16:44:41,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 16:44:41,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:40" (1/3) ... [2022-11-09 16:44:41,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d92d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:41, skipping insertion in model container [2022-11-09 16:44:41,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:40" (2/3) ... [2022-11-09 16:44:41,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d92d133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:41, skipping insertion in model container [2022-11-09 16:44:41,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:41" (3/3) ... [2022-11-09 16:44:41,695 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2022-11-09 16:44:41,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 16:44:41,708 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 16:44:41,708 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-09 16:44:41,708 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 16:44:41,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-09 16:44:41,796 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:44:41,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 16:44:41,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 16:44:41,797 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:41,801 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:41,820 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 16:44:41,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-09 16:44:41,832 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;@4733dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 16:44:41,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-09 16:44:41,928 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 4 more)] === [2022-11-09 16:44:41,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1298814101, now seen corresponding path program 1 times [2022-11-09 16:44:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822997614] [2022-11-09 16:44:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:42,348 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:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822997614] [2022-11-09 16:44:42,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822997614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:42,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:42,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 16:44:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912403949] [2022-11-09 16:44:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:42,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 16:44:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 16:44:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 16:44:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:42,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:42,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 75.5) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:42,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:42,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 16:44:42,464 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 4 more)] === [2022-11-09 16:44:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1597179399, now seen corresponding path program 1 times [2022-11-09 16:44:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:42,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923848758] [2022-11-09 16:44:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:43,145 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:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:43,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923848758] [2022-11-09 16:44:43,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923848758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:43,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:43,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:43,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25147660] [2022-11-09 16:44:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:43,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:43,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:43,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:43,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:43,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 16:44:43,270 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 4 more)] === [2022-11-09 16:44:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699453, now seen corresponding path program 1 times [2022-11-09 16:44:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:43,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820183782] [2022-11-09 16:44:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:43,817 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:43,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:43,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820183782] [2022-11-09 16:44:43,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820183782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:43,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:43,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:43,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471350359] [2022-11-09 16:44:43,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:43,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:43,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:43,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:43,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:43,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:43,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:43,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 16:44:43,932 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 4 more)] === [2022-11-09 16:44:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 544060034, now seen corresponding path program 1 times [2022-11-09 16:44:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:43,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758495811] [2022-11-09 16:44:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:44,480 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:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:44,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758495811] [2022-11-09 16:44:44,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758495811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:44,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:44,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673957569] [2022-11-09 16:44:44,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:44,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:44,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:44,486 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:44,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.2) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 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:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 16:44:44,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-09 16:44:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash -730845763, now seen corresponding path program 1 times [2022-11-09 16:44:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447439409] [2022-11-09 16:44:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:44,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:44,630 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:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:44,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447439409] [2022-11-09 16:44:44,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447439409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:44,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:44,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 16:44:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342832806] [2022-11-09 16:44:44,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:44,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 16:44:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 16:44:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 16:44:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:44,632 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:44,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 90.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:44,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:44,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:44,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 16:44:44,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-09 16:44:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1233794687, now seen corresponding path program 1 times [2022-11-09 16:44:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835296700] [2022-11-09 16:44:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:45,131 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:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835296700] [2022-11-09 16:44:45,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835296700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:45,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:45,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325279354] [2022-11-09 16:44:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:45,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:45,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:45,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:45,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 37.2) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 16:44:45,334 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 4 more)] === [2022-11-09 16:44:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 859331813, now seen corresponding path program 1 times [2022-11-09 16:44:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118636551] [2022-11-09 16:44:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:45,730 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:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:45,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118636551] [2022-11-09 16:44:45,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118636551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:45,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:45,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:45,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524219697] [2022-11-09 16:44:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:45,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:45,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:45,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:45,738 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:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 16:44:45,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-09 16:44:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1838917866, now seen corresponding path program 1 times [2022-11-09 16:44:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:45,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111846505] [2022-11-09 16:44:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:46,307 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:46,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:46,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111846505] [2022-11-09 16:44:46,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111846505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:46,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:46,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 16:44:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746921587] [2022-11-09 16:44:46,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:46,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 16:44:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 16:44:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 16:44:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:46,309 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:46,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.0) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:46,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 16:44:46,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-09 16:44:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1516955419, now seen corresponding path program 1 times [2022-11-09 16:44:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:46,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316801988] [2022-11-09 16:44:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 16:44:47,949 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:47,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-09 16:44:47,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316801988] [2022-11-09 16:44:47,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316801988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 16:44:47,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 16:44:47,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-09 16:44:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46134248] [2022-11-09 16:44:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 16:44:47,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-09 16:44:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-09 16:44:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-09 16:44:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-11-09 16:44:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:47,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 16:44:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 9.454545454545455) internal successors, (208), 23 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:47,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:47,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:47,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 16:44:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 16:44:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-09 16:44:48,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 16:44:48,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-09 16:44:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 16:44:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -808550351, now seen corresponding path program 1 times [2022-11-09 16:44:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-09 16:44:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317134908] [2022-11-09 16:44:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 16:44:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 16:44:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 16:44:49,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 16:44:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 16:44:49,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-09 16:44:49,205 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 16:44:49,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-09 16:44:49,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-11-09 16:44:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-09 16:44:49,216 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-09 16:44:49,217 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2022-11-09 16:44:49,221 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-09 16:44:49,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 16:44:49,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:44:49 BasicIcfg [2022-11-09 16:44:49,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 16:44:49,313 INFO L158 Benchmark]: Toolchain (without parser) took 8797.72ms. Allocated memory was 226.5MB in the beginning and 787.5MB in the end (delta: 561.0MB). Free memory was 191.9MB in the beginning and 562.5MB in the end (delta: -370.6MB). Peak memory consumption was 190.0MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,313 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 226.5MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 16:44:49,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.65ms. Allocated memory is still 226.5MB. Free memory was 191.6MB in the beginning and 166.6MB in the end (delta: 25.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.65ms. Allocated memory is still 226.5MB. Free memory was 166.6MB in the beginning and 163.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,314 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 226.5MB. Free memory was 163.0MB in the beginning and 159.7MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,314 INFO L158 Benchmark]: RCFGBuilder took 590.00ms. Allocated memory was 226.5MB in the beginning and 293.6MB in the end (delta: 67.1MB). Free memory was 159.5MB in the beginning and 240.5MB in the end (delta: -81.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,314 INFO L158 Benchmark]: TraceAbstraction took 7622.49ms. Allocated memory was 293.6MB in the beginning and 787.5MB in the end (delta: 493.9MB). Free memory was 239.4MB in the beginning and 562.5MB in the end (delta: -323.1MB). Peak memory consumption was 170.8MB. Max. memory is 8.0GB. [2022-11-09 16:44:49,317 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.34ms. Allocated memory is still 226.5MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.65ms. Allocated memory is still 226.5MB. Free memory was 191.6MB in the beginning and 166.6MB in the end (delta: 25.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.65ms. Allocated memory is still 226.5MB. Free memory was 166.6MB in the beginning and 163.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 226.5MB. Free memory was 163.0MB in the beginning and 159.7MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 590.00ms. Allocated memory was 226.5MB in the beginning and 293.6MB in the end (delta: 67.1MB). Free memory was 159.5MB in the beginning and 240.5MB in the end (delta: -81.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7622.49ms. Allocated memory was 293.6MB in the beginning and 787.5MB in the end (delta: 493.9MB). Free memory was 239.4MB in the beginning and 562.5MB in the end (delta: -323.1MB). Peak memory consumption was 170.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2108, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 111, negative conditional: 60, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2054, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 57, negative conditional: 6, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2054, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 57, negative conditional: 6, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 21, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 9, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 9, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1633, positive: 1567, positive conditional: 10, positive unconditional: 1557, negative: 66, negative conditional: 9, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1633, positive: 1483, positive conditional: 0, positive unconditional: 1483, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 150, positive: 84, positive conditional: 10, positive unconditional: 74, negative: 66, negative conditional: 9, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, positive: 170, positive conditional: 25, positive unconditional: 146, negative: 122, negative conditional: 18, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2085, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 1633, unknown conditional: 19, unknown unconditional: 1614] , Statistics on independence cache: Total cache size (in pairs): 1633, Positive cache size: 1567, Positive conditional cache size: 10, Positive unconditional cache size: 1557, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 12, Maximal queried relation: 4, Independence queries for same thread: 54 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 217, Number of trivial persistent sets: 202, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1608, positive: 1557, positive conditional: 0, positive unconditional: 1557, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2108, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 111, negative conditional: 60, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2054, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 57, negative conditional: 6, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2054, positive: 1997, positive conditional: 440, positive unconditional: 1557, negative: 57, negative conditional: 6, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 21, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 9, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2085, positive: 1997, positive conditional: 10, positive unconditional: 1987, negative: 88, negative conditional: 9, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1633, positive: 1567, positive conditional: 10, positive unconditional: 1557, negative: 66, negative conditional: 9, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1633, positive: 1483, positive conditional: 0, positive unconditional: 1483, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 150, positive: 84, positive conditional: 10, positive unconditional: 74, negative: 66, negative conditional: 9, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, positive: 170, positive conditional: 25, positive unconditional: 146, negative: 122, negative conditional: 18, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2085, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 1633, unknown conditional: 19, unknown unconditional: 1614] , Statistics on independence cache: Total cache size (in pairs): 1633, Positive cache size: 1567, Positive conditional cache size: 10, Positive unconditional cache size: 1557, Negative cache size: 66, Negative conditional cache size: 9, Negative unconditional cache size: 57, Eliminated conditions: 12, Maximal queried relation: 4, Independence queries for same thread: 54 - DataRaceFoundResult [Line: 1238]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, t1={15:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={15:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A = malloc(sizeof(struct s))=112, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={15:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={3:0}, B={13:0}, B = malloc(sizeof(struct s))=111, B_mutex={4:0}, malloc(sizeof(struct s))={13:0}, p={-2:0}, t1={15:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={3:0}, B={13:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={13:0}, B_mutex={4:0}, p={13:0}, p={13:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={13:0}, B_mutex={4:0}, p={13:0}, p={13:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, B={13:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={3:0}, B={13:0}, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={13:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={15:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B_mutex={4:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B_mutex={4:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=0, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B_mutex={4:0}] [L1238] EXPR 1 B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B_mutex={4:0}] [L1238] EXPR 1 B->next->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B_mutex={4:0}] [L1238] 1 B->next->datum++ VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B->next->datum++=10, B->next->datum++=113, B_mutex={4:0}] [L1254] EXPR 0 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B->next->datum++=10, B->next->datum++=113, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1254] 0 p = A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B->next->datum++=10, B->next->datum++=113, B_mutex={4:0}, p={-2:0}, t1={15:0}] [L1255] 0 p->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B->next->datum++=10, B->next->datum++=113, B_mutex={4:0}, p={-2:0}, p->datum=11, t1={15:0}] [L1238] 1 B->next->datum++ VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={13:0}, B->next={-2:0}, B->next->datum=10, B->next->datum++=10, B->next->datum++=113, B_mutex={4: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 [1228] * C: p = A->next [1254] * C: B->next->datum++ [1238] * C: A->next->datum++ [1235] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: B->next->datum [1238] * C: A->next->datum++ [1235] * C: A->next->datum++ [1235] * C: B->next->datum++ [1238] * C: B->next = p [1251] * C: A->next [1235] * C: A->next->datum++ [1235] * C: B->next [1238] * C: A->next->datum [1235] * C: A->next = p [1248] * C: B->next->datum++ [1238] * C: p = A->next [1254] * C: B = malloc(sizeof(struct s)) [1249] * C: B->next->datum++ [1238] * C: B->next->datum [1238] * C: printf("%d\n", p->datum) [1255] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: A->next [1248] * C: A->next->datum++ [1235] * C: A->next->datum [1235] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: A->next->datum++ [1235] * C: B->next->datum [1238] * C: B->next [1251] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p = A->next [1254] * C: A->next->datum++ [1235] * C: B->next = p [1251] * C: A->next = p [1248] * C: A->next->datum [1235] * C: init(B,5) [1250] * C: A = malloc(sizeof(struct s)) [1246] * C: p -> next = ((void *)0) [1229] * C: p = A->next [1254] * C: A->next->datum++ [1235] * C: init(A,3) [1247] * C: B->next->datum [1238] * C: A->next->datum [1235] * C: A->next [1254] and C: B->next->datum++ [1238] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 358 locations, 37 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.9s, 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: 69, 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, 4.4s InterpolantComputationTime, 1825 NumberOfCodeBlocks, 1825 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 5692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-09 16:44:49,444 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:49,654 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...