/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 23:55:04,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 23:55:04,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 23:55:04,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 23:55:04,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 23:55:04,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 23:55:04,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 23:55:04,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 23:55:04,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 23:55:04,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 23:55:04,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 23:55:04,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 23:55:04,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 23:55:04,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 23:55:04,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 23:55:04,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 23:55:04,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 23:55:04,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 23:55:04,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 23:55:04,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 23:55:04,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 23:55:04,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 23:55:04,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 23:55:04,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 23:55:04,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 23:55:04,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 23:55:04,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 23:55:04,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 23:55:04,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 23:55:04,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 23:55:04,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 23:55:04,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 23:55:04,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 23:55:04,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 23:55:04,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 23:55:04,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 23:55:04,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 23:55:04,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 23:55:04,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 23:55:04,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 23:55:04,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 23:55:04,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-10 23:55:04,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 23:55:04,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 23:55:04,969 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 23:55:04,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 23:55:04,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 23:55:04,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 23:55:04,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 23:55:04,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 23:55:04,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 23:55:04,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 23:55:04,971 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 23:55:04,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 23:55:04,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 23:55:04,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 23:55:04,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 23:55:04,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 23:55:04,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 23:55:04,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 23:55:04,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:55:04,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 23:55:04,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 23:55:04,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 23:55:04,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 23:55:04,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 23:55:04,975 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 23:55:04,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 23:55:04,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-10 23:55:05,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 23:55:05,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 23:55:05,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 23:55:05,174 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 23:55:05,176 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 23:55:05,177 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i [2022-02-10 23:55:05,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7586a6ea1/021913c6ef90476483f4f5d6dcc6b09e/FLAG2d09727c6 [2022-02-10 23:55:05,676 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 23:55:05,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_28-list2alloc.i [2022-02-10 23:55:05,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7586a6ea1/021913c6ef90476483f4f5d6dcc6b09e/FLAG2d09727c6 [2022-02-10 23:55:06,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7586a6ea1/021913c6ef90476483f4f5d6dcc6b09e [2022-02-10 23:55:06,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 23:55:06,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 23:55:06,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 23:55:06,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 23:55:06,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 23:55:06,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89ad918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06, skipping insertion in model container [2022-02-10 23:55:06,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 23:55:06,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 23:55:06,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:55:06,618 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 23:55:06,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 23:55:06,695 INFO L208 MainTranslator]: Completed translation [2022-02-10 23:55:06,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06 WrapperNode [2022-02-10 23:55:06,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 23:55:06,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 23:55:06,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 23:55:06,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 23:55:06,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,748 INFO L137 Inliner]: procedures = 368, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-02-10 23:55:06,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 23:55:06,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 23:55:06,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 23:55:06,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 23:55:06,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 23:55:06,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 23:55:06,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 23:55:06,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 23:55:06,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (1/1) ... [2022-02-10 23:55:06,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 23:55:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 23:55:06,825 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-02-10 23:55:06,826 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-02-10 23:55:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 23:55:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 23:55:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 23:55:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 23:55:06,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 23:55:06,851 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 23:55:07,003 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 23:55:07,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 23:55:07,352 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 23:55:07,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 23:55:07,363 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 23:55:07,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:55:07 BoogieIcfgContainer [2022-02-10 23:55:07,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 23:55:07,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 23:55:07,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 23:55:07,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 23:55:07,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 11:55:06" (1/3) ... [2022-02-10 23:55:07,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9cfffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:55:07, skipping insertion in model container [2022-02-10 23:55:07,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 11:55:06" (2/3) ... [2022-02-10 23:55:07,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9cfffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 11:55:07, skipping insertion in model container [2022-02-10 23:55:07,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 11:55:07" (3/3) ... [2022-02-10 23:55:07,371 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2022-02-10 23:55:07,375 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 23:55:07,375 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 23:55:07,375 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-02-10 23:55:07,375 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,406 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,407 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,408 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,408 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,408 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,409 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,410 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,411 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,411 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,411 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,411 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,411 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,412 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,413 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,413 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,413 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,413 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,413 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,414 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,414 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,414 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,414 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,414 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,415 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,416 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,417 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,418 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,423 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,423 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,423 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,424 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,425 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 23:55:07,426 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 23:55:07,454 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 23:55:07,459 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 23:55:07,459 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-10 23:55:07,467 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184 places, 180 transitions, 365 flow [2022-02-10 23:55:07,535 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1449 states, 1423 states have (on average 1.9093464511595222) internal successors, (2717), 1448 states have internal predecessors, (2717), 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-02-10 23:55:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 1449 states, 1423 states have (on average 1.9093464511595222) internal successors, (2717), 1448 states have internal predecessors, (2717), 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-02-10 23:55:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-10 23:55:07,548 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:07,548 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:07,549 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2052627791, now seen corresponding path program 1 times [2022-02-10 23:55:07,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:07,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869493914] [2022-02-10 23:55:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:07,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:07,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869493914] [2022-02-10 23:55:07,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869493914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:07,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:07,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:55:07,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452400668] [2022-02-10 23:55:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:07,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:55:07,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:55:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:07,895 INFO L87 Difference]: Start difference. First operand has 1449 states, 1423 states have (on average 1.9093464511595222) internal successors, (2717), 1448 states have internal predecessors, (2717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-02-10 23:55:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:08,077 INFO L93 Difference]: Finished difference Result 1447 states and 2715 transitions. [2022-02-10 23:55:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:55:08,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-02-10 23:55:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:08,109 INFO L225 Difference]: With dead ends: 1447 [2022-02-10 23:55:08,109 INFO L226 Difference]: Without dead ends: 1447 [2022-02-10 23:55:08,110 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:08,113 INFO L934 BasicCegarLoop]: 168 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:08,113 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 388 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:55:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-02-10 23:55:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1447. [2022-02-10 23:55:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1423 states have (on average 1.9079409697821503) internal successors, (2715), 1446 states have internal predecessors, (2715), 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-02-10 23:55:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2715 transitions. [2022-02-10 23:55:08,233 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2715 transitions. Word has length 40 [2022-02-10 23:55:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:08,233 INFO L470 AbstractCegarLoop]: Abstraction has 1447 states and 2715 transitions. [2022-02-10 23:55:08,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-02-10 23:55:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2715 transitions. [2022-02-10 23:55:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-10 23:55:08,234 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:08,234 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:08,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 23:55:08,235 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash 320042173, now seen corresponding path program 1 times [2022-02-10 23:55:08,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:08,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715711779] [2022-02-10 23:55:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:08,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:08,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715711779] [2022-02-10 23:55:08,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715711779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:08,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:08,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:55:08,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65438584] [2022-02-10 23:55:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:08,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:55:08,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:55:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:08,402 INFO L87 Difference]: Start difference. First operand 1447 states and 2715 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:55:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:08,551 INFO L93 Difference]: Finished difference Result 1445 states and 2713 transitions. [2022-02-10 23:55:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:55:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-10 23:55:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:08,557 INFO L225 Difference]: With dead ends: 1445 [2022-02-10 23:55:08,557 INFO L226 Difference]: Without dead ends: 1445 [2022-02-10 23:55:08,560 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:08,561 INFO L934 BasicCegarLoop]: 166 mSDtfsCounter, 4 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:08,562 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:55:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-02-10 23:55:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2022-02-10 23:55:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1423 states have (on average 1.9065354884047787) internal successors, (2713), 1444 states have internal predecessors, (2713), 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-02-10 23:55:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2713 transitions. [2022-02-10 23:55:08,589 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2713 transitions. Word has length 48 [2022-02-10 23:55:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:08,589 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 2713 transitions. [2022-02-10 23:55:08,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:55:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2713 transitions. [2022-02-10 23:55:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-10 23:55:08,592 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:08,592 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:08,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 23:55:08,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash -170333930, now seen corresponding path program 1 times [2022-02-10 23:55:08,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:08,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248647204] [2022-02-10 23:55:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:08,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:08,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248647204] [2022-02-10 23:55:08,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248647204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:08,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:08,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:08,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821699705] [2022-02-10 23:55:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:08,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:08,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,665 INFO L87 Difference]: Start difference. First operand 1445 states and 2713 transitions. Second operand has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:55:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:08,680 INFO L93 Difference]: Finished difference Result 1444 states and 2712 transitions. [2022-02-10 23:55:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-10 23:55:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:08,686 INFO L225 Difference]: With dead ends: 1444 [2022-02-10 23:55:08,686 INFO L226 Difference]: Without dead ends: 1444 [2022-02-10 23:55:08,687 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,691 INFO L934 BasicCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:08,693 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-02-10 23:55:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2022-02-10 23:55:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1423 states have (on average 1.9058327477160928) internal successors, (2712), 1443 states have internal predecessors, (2712), 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-02-10 23:55:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2712 transitions. [2022-02-10 23:55:08,725 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2712 transitions. Word has length 56 [2022-02-10 23:55:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:08,727 INFO L470 AbstractCegarLoop]: Abstraction has 1444 states and 2712 transitions. [2022-02-10 23:55:08,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 23:55:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2712 transitions. [2022-02-10 23:55:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-10 23:55:08,728 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:08,728 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:08,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 23:55:08,728 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2000222690, now seen corresponding path program 1 times [2022-02-10 23:55:08,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:08,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897530881] [2022-02-10 23:55:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:08,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:08,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897530881] [2022-02-10 23:55:08,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897530881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:08,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:08,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:08,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417650240] [2022-02-10 23:55:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:08,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:08,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,802 INFO L87 Difference]: Start difference. First operand 1444 states and 2712 transitions. Second operand has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 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-02-10 23:55:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:08,816 INFO L93 Difference]: Finished difference Result 1443 states and 2711 transitions. [2022-02-10 23:55:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-02-10 23:55:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:08,821 INFO L225 Difference]: With dead ends: 1443 [2022-02-10 23:55:08,821 INFO L226 Difference]: Without dead ends: 1443 [2022-02-10 23:55:08,822 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,824 INFO L934 BasicCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:08,824 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 334 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-02-10 23:55:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2022-02-10 23:55:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1423 states have (on average 1.9051300070274069) internal successors, (2711), 1442 states have internal predecessors, (2711), 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-02-10 23:55:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2711 transitions. [2022-02-10 23:55:08,844 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2711 transitions. Word has length 89 [2022-02-10 23:55:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:08,844 INFO L470 AbstractCegarLoop]: Abstraction has 1443 states and 2711 transitions. [2022-02-10 23:55:08,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.5) internal successors, (89), 3 states have internal predecessors, (89), 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-02-10 23:55:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2711 transitions. [2022-02-10 23:55:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-10 23:55:08,849 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:08,849 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:08,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 23:55:08,849 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:08,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1678385605, now seen corresponding path program 1 times [2022-02-10 23:55:08,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:08,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431206108] [2022-02-10 23:55:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:08,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:08,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431206108] [2022-02-10 23:55:08,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431206108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:08,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:08,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 23:55:08,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410645824] [2022-02-10 23:55:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:08,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:08,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:08,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,929 INFO L87 Difference]: Start difference. First operand 1443 states and 2711 transitions. Second operand has 3 states, 2 states have (on average 50.0) internal successors, (100), 3 states have internal predecessors, (100), 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-02-10 23:55:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:08,940 INFO L93 Difference]: Finished difference Result 1364 states and 2555 transitions. [2022-02-10 23:55:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 50.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-10 23:55:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:08,947 INFO L225 Difference]: With dead ends: 1364 [2022-02-10 23:55:08,947 INFO L226 Difference]: Without dead ends: 1364 [2022-02-10 23:55:08,947 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:08,948 INFO L934 BasicCegarLoop]: 178 mSDtfsCounter, 74 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:08,948 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 278 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-02-10 23:55:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-02-10 23:55:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1353 states have (on average 1.8883961566888396) internal successors, (2555), 1363 states have internal predecessors, (2555), 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-02-10 23:55:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2555 transitions. [2022-02-10 23:55:08,985 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2555 transitions. Word has length 100 [2022-02-10 23:55:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:08,986 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 2555 transitions. [2022-02-10 23:55:08,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 50.0) internal successors, (100), 3 states have internal predecessors, (100), 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-02-10 23:55:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2555 transitions. [2022-02-10 23:55:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-10 23:55:08,992 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:08,993 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:08,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 23:55:08,993 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1501407425, now seen corresponding path program 1 times [2022-02-10 23:55:08,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:08,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64680313] [2022-02-10 23:55:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:09,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:09,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64680313] [2022-02-10 23:55:09,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64680313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:09,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:09,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:55:09,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896401842] [2022-02-10 23:55:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:09,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:55:09,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:55:09,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,100 INFO L87 Difference]: Start difference. First operand 1364 states and 2555 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-02-10 23:55:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:09,198 INFO L93 Difference]: Finished difference Result 1456 states and 2731 transitions. [2022-02-10 23:55:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:55:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-02-10 23:55:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:09,204 INFO L225 Difference]: With dead ends: 1456 [2022-02-10 23:55:09,204 INFO L226 Difference]: Without dead ends: 1456 [2022-02-10 23:55:09,206 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,207 INFO L934 BasicCegarLoop]: 232 mSDtfsCounter, 92 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:09,208 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 415 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:55:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-02-10 23:55:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1404. [2022-02-10 23:55:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1393 states have (on average 1.8887293610911702) internal successors, (2631), 1403 states have internal predecessors, (2631), 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-02-10 23:55:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2631 transitions. [2022-02-10 23:55:09,230 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2631 transitions. Word has length 106 [2022-02-10 23:55:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:09,230 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 2631 transitions. [2022-02-10 23:55:09,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 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-02-10 23:55:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2631 transitions. [2022-02-10 23:55:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-10 23:55:09,231 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:09,231 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:09,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 23:55:09,232 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1742525625, now seen corresponding path program 1 times [2022-02-10 23:55:09,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:09,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646873950] [2022-02-10 23:55:09,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:09,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:09,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:09,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646873950] [2022-02-10 23:55:09,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646873950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:09,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:09,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:55:09,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700332409] [2022-02-10 23:55:09,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:09,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:55:09,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:09,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:55:09,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,349 INFO L87 Difference]: Start difference. First operand 1404 states and 2631 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 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-02-10 23:55:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:09,556 INFO L93 Difference]: Finished difference Result 1622 states and 3055 transitions. [2022-02-10 23:55:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:55:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-02-10 23:55:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:09,563 INFO L225 Difference]: With dead ends: 1622 [2022-02-10 23:55:09,563 INFO L226 Difference]: Without dead ends: 1510 [2022-02-10 23:55:09,563 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,564 INFO L934 BasicCegarLoop]: 277 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:09,565 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 503 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 23:55:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-02-10 23:55:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1468. [2022-02-10 23:55:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1457 states have (on average 1.8908716540837336) internal successors, (2755), 1467 states have internal predecessors, (2755), 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-02-10 23:55:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2755 transitions. [2022-02-10 23:55:09,593 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2755 transitions. Word has length 111 [2022-02-10 23:55:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:09,593 INFO L470 AbstractCegarLoop]: Abstraction has 1468 states and 2755 transitions. [2022-02-10 23:55:09,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 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-02-10 23:55:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2755 transitions. [2022-02-10 23:55:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-10 23:55:09,594 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:09,594 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:09,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 23:55:09,594 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash -852845884, now seen corresponding path program 1 times [2022-02-10 23:55:09,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:09,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988210016] [2022-02-10 23:55:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:09,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:09,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988210016] [2022-02-10 23:55:09,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988210016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:09,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:09,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 23:55:09,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20187826] [2022-02-10 23:55:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:09,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 23:55:09,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 23:55:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,698 INFO L87 Difference]: Start difference. First operand 1468 states and 2755 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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-02-10 23:55:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:09,843 INFO L93 Difference]: Finished difference Result 1555 states and 2922 transitions. [2022-02-10 23:55:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 23:55:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-02-10 23:55:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:09,848 INFO L225 Difference]: With dead ends: 1555 [2022-02-10 23:55:09,848 INFO L226 Difference]: Without dead ends: 1555 [2022-02-10 23:55:09,848 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 23:55:09,849 INFO L934 BasicCegarLoop]: 234 mSDtfsCounter, 89 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:09,849 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 511 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 23:55:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2022-02-10 23:55:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1507. [2022-02-10 23:55:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1496 states have (on average 1.8910427807486632) internal successors, (2829), 1506 states have internal predecessors, (2829), 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-02-10 23:55:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2829 transitions. [2022-02-10 23:55:09,873 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2829 transitions. Word has length 114 [2022-02-10 23:55:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:09,873 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 2829 transitions. [2022-02-10 23:55:09,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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-02-10 23:55:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2829 transitions. [2022-02-10 23:55:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-10 23:55:09,874 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:09,874 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:09,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 23:55:09,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1417418652, now seen corresponding path program 1 times [2022-02-10 23:55:09,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:09,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496782073] [2022-02-10 23:55:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 23:55:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 23:55:09,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 23:55:09,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496782073] [2022-02-10 23:55:09,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496782073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 23:55:09,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 23:55:09,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 23:55:09,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376160103] [2022-02-10 23:55:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 23:55:09,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 23:55:09,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 23:55:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 23:55:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:09,920 INFO L87 Difference]: Start difference. First operand 1507 states and 2829 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-02-10 23:55:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 23:55:09,937 INFO L93 Difference]: Finished difference Result 1402 states and 2593 transitions. [2022-02-10 23:55:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 23:55:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-02-10 23:55:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 23:55:09,942 INFO L225 Difference]: With dead ends: 1402 [2022-02-10 23:55:09,942 INFO L226 Difference]: Without dead ends: 1402 [2022-02-10 23:55:09,942 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 23:55:09,944 INFO L934 BasicCegarLoop]: 205 mSDtfsCounter, 59 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 23:55:09,944 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 23:55:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-02-10 23:55:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-02-10 23:55:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1391 states have (on average 1.8641265276779295) internal successors, (2593), 1401 states have internal predecessors, (2593), 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-02-10 23:55:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2593 transitions. [2022-02-10 23:55:09,965 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2593 transitions. Word has length 118 [2022-02-10 23:55:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 23:55:09,965 INFO L470 AbstractCegarLoop]: Abstraction has 1402 states and 2593 transitions. [2022-02-10 23:55:09,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-02-10 23:55:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2593 transitions. [2022-02-10 23:55:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-10 23:55:09,966 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 23:55:09,967 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 23:55:09,967 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2022-02-10 23:55:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 23:55:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1719135240, now seen corresponding path program 2 times [2022-02-10 23:55:09,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 23:55:09,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971640048] [2022-02-10 23:55:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 23:55:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 23:55:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:10,018 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 23:55:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 23:55:10,075 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 23:55:10,075 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 23:55:10,076 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2022-02-10 23:55:10,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2022-02-10 23:55:10,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2022-02-10 23:55:10,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2022-02-10 23:55:10,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2022-02-10 23:55:10,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (11 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2022-02-10 23:55:10,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2022-02-10 23:55:10,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2022-02-10 23:55:10,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2022-02-10 23:55:10,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2022-02-10 23:55:10,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 23:55:10,081 INFO L733 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 23:55:10,086 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 23:55:10,086 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 23:55:10,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 11:55:10 BasicIcfg [2022-02-10 23:55:10,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 23:55:10,144 INFO L158 Benchmark]: Toolchain (without parser) took 3937.27ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 151.5MB in the beginning and 116.4MB in the end (delta: 35.1MB). Peak memory consumption was 79.8MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,144 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 23:55:10,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.35ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 153.5MB in the end (delta: -2.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.32ms. Allocated memory is still 205.5MB. Free memory was 153.5MB in the beginning and 150.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,144 INFO L158 Benchmark]: Boogie Preprocessor took 43.85ms. Allocated memory is still 205.5MB. Free memory was 150.3MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,145 INFO L158 Benchmark]: RCFGBuilder took 572.10ms. Allocated memory is still 205.5MB. Free memory was 148.3MB in the beginning and 128.8MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,145 INFO L158 Benchmark]: TraceAbstraction took 2777.38ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 128.3MB in the beginning and 116.4MB in the end (delta: 11.9MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. [2022-02-10 23:55:10,146 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.10ms. Allocated memory is still 205.5MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.35ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 153.5MB in the end (delta: -2.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.32ms. Allocated memory is still 205.5MB. Free memory was 153.5MB in the beginning and 150.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.85ms. Allocated memory is still 205.5MB. Free memory was 150.3MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 572.10ms. Allocated memory is still 205.5MB. Free memory was 148.3MB in the beginning and 128.8MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2777.38ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 128.3MB in the beginning and 116.4MB in the end (delta: 11.9MB). Peak memory consumption was 57.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1237]: 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}] [L1233] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1234] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1245] 0 pthread_t t1; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, t1={9:0}] [L1246] CALL, EXPR 0 new(3) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, x=3] [L1229] 0 p->datum = x VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1230] 0 p->next = ((void *)0) VAL [\old(x)=3, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1231] 0 return p; VAL [\old(x)=3, \result={-2:0}, A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}, x=3] [L1246] RET, EXPR 0 new(3) [L1246] 0 A = new(3) VAL [A={-2:0}, A = new(3)=58, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, new(3)={-2:0}, t1={9:0}] [L1247] CALL, EXPR 0 new(5) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, malloc(sizeof(struct s))={-3:0}, p={-3:0}, x=5] [L1229] 0 p->datum = x VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1230] 0 p->next = ((void *)0) VAL [\old(x)=5, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1231] 0 return p; VAL [\old(x)=5, \result={-3:0}, A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-3:0}, x=5] [L1247] RET, EXPR 0 new(5) [L1247] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B = new(5)=44, B_mutex={2:0}, new(5)={-3:0}, t1={9:0}] [L1248] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={9:0}] [L1249] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, t1={9:0}] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, t1={9:0}] [L1251] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1253] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1237] EXPR 1 A->datum VAL [A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] [L1253] 0 *data = 42 VAL [*data = 42=56, A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}, data={-2:0}, t1={9:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A->datum=42, A_mutex={1:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *data = 42 [1253] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->next = ((void *)0) [1230] * C: B = new(5) [1247] * C: p->next = ((void *)0) [1230] * C: A = new(3) [1246] and C: A->datum++ [1237] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 236 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 3485 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1692 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 864 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1803 mSDtfsCounter, 864 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1507occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 142 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 1228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-10 23:55:10,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...