/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_27-base_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 01:57:48,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:57:48,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:57:48,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:57:48,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:57:48,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:57:48,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:57:48,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:57:48,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:57:48,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:57:48,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:57:48,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:57:48,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:57:48,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:57:48,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:57:48,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:57:48,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:57:48,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:57:48,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:57:48,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:57:48,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:57:48,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:57:48,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:57:48,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:57:48,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:57:48,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:57:48,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:57:48,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:57:48,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:57:48,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:57:48,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:57:48,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:57:48,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:57:48,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:57:48,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:57:48,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:57:48,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:57:48,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:57:48,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:57:48,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:57:48,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:57:48,452 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-09 01:57:48,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:57:48,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:57:48,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:57:48,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:57:48,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:57:48,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:57:48,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:57:48,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:57:48,471 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:57:48,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:57:48,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:57:48,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:57:48,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:57:48,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:57:48,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:57:48,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:57:48,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:57:48,474 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:57:48,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:57:48,474 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-09 01:57:48,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:57:48,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:57:48,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:57:48,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:57:48,701 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:57:48,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_27-base_rc.i [2022-02-09 01:57:48,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cb8dea2/f7e49cd24f36419da007cda58ae37e71/FLAGd190299db [2022-02-09 01:57:49,143 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:57:49,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_27-base_rc.i [2022-02-09 01:57:49,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cb8dea2/f7e49cd24f36419da007cda58ae37e71/FLAGd190299db [2022-02-09 01:57:49,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cb8dea2/f7e49cd24f36419da007cda58ae37e71 [2022-02-09 01:57:49,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:57:49,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:57:49,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:57:49,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:57:49,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:57:49,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df69af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49, skipping insertion in model container [2022-02-09 01:57:49,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:57:49,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:57:49,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:57:49,843 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:57:49,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:57:49,914 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:57:49,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49 WrapperNode [2022-02-09 01:57:49,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:57:49,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:57:49,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:57:49,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:57:49,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,950 INFO L137 Inliner]: procedures = 265, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2022-02-09 01:57:49,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:57:49,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:57:49,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:57:49,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:57:49,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:57:49,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:57:49,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:57:49,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:57:49,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (1/1) ... [2022-02-09 01:57:49,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:57:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:57:50,007 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-09 01:57:50,009 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-09 01:57:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:57:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-09 01:57:50,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 01:57:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:57:50,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:57:50,033 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 01:57:50,158 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:57:50,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:57:50,288 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:57:50,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:57:50,294 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-09 01:57:50,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:57:50 BoogieIcfgContainer [2022-02-09 01:57:50,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:57:50,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:57:50,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:57:50,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:57:50,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:57:49" (1/3) ... [2022-02-09 01:57:50,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41852e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:57:50, skipping insertion in model container [2022-02-09 01:57:50,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:57:49" (2/3) ... [2022-02-09 01:57:50,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41852e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:57:50, skipping insertion in model container [2022-02-09 01:57:50,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:57:50" (3/3) ... [2022-02-09 01:57:50,304 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_27-base_rc.i [2022-02-09 01:57:50,308 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:57:50,308 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:57:50,308 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-09 01:57:50,308 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:57:50,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,343 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,344 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,345 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,346 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,347 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,348 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,349 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,350 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,351 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,352 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,353 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,354 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,355 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,356 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,357 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,358 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,367 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,368 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,369 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_good_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~post30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,371 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_bad_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,372 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,375 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_##fun~~TO~VOID_#in~#fp#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,376 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~g~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:57:50,378 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 01:57:50,418 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:57:50,425 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 01:57:50,426 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-02-09 01:57:50,439 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 102 transitions, 209 flow [2022-02-09 01:57:50,506 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1117 states, 1100 states have (on average 1.9536363636363636) internal successors, (2149), 1116 states have internal predecessors, (2149), 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-09 01:57:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 1117 states, 1100 states have (on average 1.9536363636363636) internal successors, (2149), 1116 states have internal predecessors, (2149), 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-09 01:57:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-09 01:57:50,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:50,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:50,517 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:50,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1096485787, now seen corresponding path program 1 times [2022-02-09 01:57:50,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:50,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111444281] [2022-02-09 01:57:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:50,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:50,720 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-09 01:57:50,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:50,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111444281] [2022-02-09 01:57:50,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111444281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:50,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:50,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:57:50,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268387360] [2022-02-09 01:57:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:50,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:50,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:50,757 INFO L87 Difference]: Start difference. First operand has 1117 states, 1100 states have (on average 1.9536363636363636) internal successors, (2149), 1116 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 01:57:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:50,825 INFO L93 Difference]: Finished difference Result 1760 states and 3386 transitions. [2022-02-09 01:57:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:50,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-02-09 01:57:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:50,846 INFO L225 Difference]: With dead ends: 1760 [2022-02-09 01:57:50,846 INFO L226 Difference]: Without dead ends: 1760 [2022-02-09 01:57:50,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:50,853 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 64 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:50,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 215 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-02-09 01:57:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1128. [2022-02-09 01:57:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1111 states have (on average 1.9531953195319531) internal successors, (2170), 1127 states have internal predecessors, (2170), 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-09 01:57:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2170 transitions. [2022-02-09 01:57:50,930 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2170 transitions. Word has length 36 [2022-02-09 01:57:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:50,931 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 2170 transitions. [2022-02-09 01:57:50,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-09 01:57:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2170 transitions. [2022-02-09 01:57:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-09 01:57:50,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:50,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:50,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:57:50,933 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:50,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1567713335, now seen corresponding path program 1 times [2022-02-09 01:57:50,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:50,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345253943] [2022-02-09 01:57:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:50,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:50,997 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-09 01:57:50,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:50,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345253943] [2022-02-09 01:57:50,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345253943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:50,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:50,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:57:50,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797625603] [2022-02-09 01:57:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:50,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:50,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:51,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,000 INFO L87 Difference]: Start difference. First operand 1128 states and 2170 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-09 01:57:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,034 INFO L93 Difference]: Finished difference Result 1202 states and 2318 transitions. [2022-02-09 01:57:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-02-09 01:57:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,053 INFO L225 Difference]: With dead ends: 1202 [2022-02-09 01:57:51,053 INFO L226 Difference]: Without dead ends: 1202 [2022-02-09 01:57:51,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,054 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-02-09 01:57:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1161. [2022-02-09 01:57:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1145 states have (on average 1.9528384279475983) internal successors, (2236), 1160 states have internal predecessors, (2236), 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-09 01:57:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2236 transitions. [2022-02-09 01:57:51,141 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2236 transitions. Word has length 38 [2022-02-09 01:57:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,142 INFO L470 AbstractCegarLoop]: Abstraction has 1161 states and 2236 transitions. [2022-02-09 01:57:51,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-09 01:57:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2236 transitions. [2022-02-09 01:57:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-09 01:57:51,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:57:51,144 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1780191677, now seen corresponding path program 1 times [2022-02-09 01:57:51,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351912252] [2022-02-09 01:57:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:51,229 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-09 01:57:51,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:51,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351912252] [2022-02-09 01:57:51,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351912252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:51,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:51,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 01:57:51,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210339217] [2022-02-09 01:57:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:51,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:51,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,232 INFO L87 Difference]: Start difference. First operand 1161 states and 2236 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:57:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,281 INFO L93 Difference]: Finished difference Result 1081 states and 2054 transitions. [2022-02-09 01:57:51,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-09 01:57:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,285 INFO L225 Difference]: With dead ends: 1081 [2022-02-09 01:57:51,285 INFO L226 Difference]: Without dead ends: 1081 [2022-02-09 01:57:51,285 INFO L932 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-09 01:57:51,286 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 57 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 231 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-02-09 01:57:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1011. [2022-02-09 01:57:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1002 states have (on average 1.9221556886227544) internal successors, (1926), 1010 states have internal predecessors, (1926), 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-09 01:57:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1926 transitions. [2022-02-09 01:57:51,306 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1926 transitions. Word has length 43 [2022-02-09 01:57:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,307 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1926 transitions. [2022-02-09 01:57:51,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 01:57:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1926 transitions. [2022-02-09 01:57:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-09 01:57:51,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 01:57:51,310 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash 891665540, now seen corresponding path program 1 times [2022-02-09 01:57:51,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068606820] [2022-02-09 01:57:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:51,344 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-09 01:57:51,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:51,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068606820] [2022-02-09 01:57:51,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068606820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:51,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:51,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:57:51,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655969027] [2022-02-09 01:57:51,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:51,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:51,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,346 INFO L87 Difference]: Start difference. First operand 1011 states and 1926 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-09 01:57:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,370 INFO L93 Difference]: Finished difference Result 981 states and 1835 transitions. [2022-02-09 01:57:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-02-09 01:57:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,373 INFO L225 Difference]: With dead ends: 981 [2022-02-09 01:57:51,373 INFO L226 Difference]: Without dead ends: 816 [2022-02-09 01:57:51,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,374 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-02-09 01:57:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 784. [2022-02-09 01:57:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 779 states have (on average 1.8703465982028242) internal successors, (1457), 783 states have internal predecessors, (1457), 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-09 01:57:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1457 transitions. [2022-02-09 01:57:51,391 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1457 transitions. Word has length 45 [2022-02-09 01:57:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,391 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1457 transitions. [2022-02-09 01:57:51,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-09 01:57:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1457 transitions. [2022-02-09 01:57:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-09 01:57:51,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 01:57:51,395 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -112844375, now seen corresponding path program 1 times [2022-02-09 01:57:51,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017807353] [2022-02-09 01:57:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:51,430 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-09 01:57:51,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:51,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017807353] [2022-02-09 01:57:51,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017807353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:51,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:51,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:57:51,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474434016] [2022-02-09 01:57:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:51,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:51,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:51,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,432 INFO L87 Difference]: Start difference. First operand 784 states and 1457 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-09 01:57:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,456 INFO L93 Difference]: Finished difference Result 776 states and 1432 transitions. [2022-02-09 01:57:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-02-09 01:57:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,458 INFO L225 Difference]: With dead ends: 776 [2022-02-09 01:57:51,459 INFO L226 Difference]: Without dead ends: 704 [2022-02-09 01:57:51,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,463 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 194 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-09 01:57:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2022-02-09 01:57:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 700 states have (on average 1.84) internal successors, (1288), 703 states have internal predecessors, (1288), 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-09 01:57:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1288 transitions. [2022-02-09 01:57:51,479 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1288 transitions. Word has length 50 [2022-02-09 01:57:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,480 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1288 transitions. [2022-02-09 01:57:51,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 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-09 01:57:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1288 transitions. [2022-02-09 01:57:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-09 01:57:51,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 01:57:51,483 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2052563157, now seen corresponding path program 1 times [2022-02-09 01:57:51,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350473928] [2022-02-09 01:57:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:51,521 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-09 01:57:51,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:51,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350473928] [2022-02-09 01:57:51,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350473928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:51,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:51,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:57:51,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319702404] [2022-02-09 01:57:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:51,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:57:51,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:57:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,522 INFO L87 Difference]: Start difference. First operand 704 states and 1288 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-09 01:57:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,542 INFO L93 Difference]: Finished difference Result 696 states and 1263 transitions. [2022-02-09 01:57:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:57:51,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-02-09 01:57:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,545 INFO L225 Difference]: With dead ends: 696 [2022-02-09 01:57:51,545 INFO L226 Difference]: Without dead ends: 520 [2022-02-09 01:57:51,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:57:51,546 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 195 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-09 01:57:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2022-02-09 01:57:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 517 states have (on average 1.7775628626692457) internal successors, (919), 519 states have internal predecessors, (919), 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-09 01:57:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 919 transitions. [2022-02-09 01:57:51,557 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 919 transitions. Word has length 52 [2022-02-09 01:57:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,558 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 919 transitions. [2022-02-09 01:57:51,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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-09 01:57:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 919 transitions. [2022-02-09 01:57:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-09 01:57:51,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-09 01:57:51,560 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1745379546, now seen corresponding path program 1 times [2022-02-09 01:57:51,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455710327] [2022-02-09 01:57:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:57:51,690 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-09 01:57:51,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:57:51,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455710327] [2022-02-09 01:57:51,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455710327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:57:51,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:57:51,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:57:51,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581982601] [2022-02-09 01:57:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:57:51,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-09 01:57:51,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:57:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-09 01:57:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-09 01:57:51,692 INFO L87 Difference]: Start difference. First operand 520 states and 919 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-09 01:57:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:57:51,739 INFO L93 Difference]: Finished difference Result 535 states and 910 transitions. [2022-02-09 01:57:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-09 01:57:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2022-02-09 01:57:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:57:51,741 INFO L225 Difference]: With dead ends: 535 [2022-02-09 01:57:51,741 INFO L226 Difference]: Without dead ends: 535 [2022-02-09 01:57:51,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-09 01:57:51,744 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 115 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:57:51,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 434 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:57:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-02-09 01:57:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 445. [2022-02-09 01:57:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 442 states have (on average 1.7330316742081449) internal successors, (766), 444 states have internal predecessors, (766), 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-09 01:57:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 766 transitions. [2022-02-09 01:57:51,753 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 766 transitions. Word has length 64 [2022-02-09 01:57:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:57:51,753 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 766 transitions. [2022-02-09 01:57:51,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-09 01:57:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 766 transitions. [2022-02-09 01:57:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-09 01:57:51,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:57:51,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-09 01:57:51,756 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 10 more)] === [2022-02-09 01:57:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:57:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1950478754, now seen corresponding path program 2 times [2022-02-09 01:57:51,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:57:51,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824956869] [2022-02-09 01:57:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:57:51,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:57:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:57:51,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-09 01:57:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:57:51,820 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-09 01:57:51,820 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-09 01:57:51,820 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2022-02-09 01:57:51,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2022-02-09 01:57:51,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (10 of 13 remaining) [2022-02-09 01:57:51,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2022-02-09 01:57:51,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2022-02-09 01:57:51,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2022-02-09 01:57:51,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2022-02-09 01:57:51,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2022-02-09 01:57:51,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 01:57:51,827 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-02-09 01:57:51,830 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 01:57:51,830 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 01:57:51,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 01:57:51 BasicIcfg [2022-02-09 01:57:51,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 01:57:51,873 INFO L158 Benchmark]: Toolchain (without parser) took 2392.33ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 132.0MB in the beginning and 179.5MB in the end (delta: -47.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,873 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory was 150.1MB in the beginning and 150.1MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 01:57:51,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.88ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 143.3MB in the end (delta: -11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.16ms. Allocated memory is still 181.4MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,874 INFO L158 Benchmark]: Boogie Preprocessor took 23.11ms. Allocated memory is still 181.4MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,874 INFO L158 Benchmark]: RCFGBuilder took 321.03ms. Allocated memory is still 181.4MB. Free memory was 139.6MB in the beginning and 126.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,874 INFO L158 Benchmark]: TraceAbstraction took 1575.56ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 126.0MB in the beginning and 179.5MB in the end (delta: -53.6MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-02-09 01:57:51,875 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.13ms. Allocated memory is still 181.4MB. Free memory was 150.1MB in the beginning and 150.1MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 422.88ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 143.3MB in the end (delta: -11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.16ms. Allocated memory is still 181.4MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.11ms. Allocated memory is still 181.4MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 321.03ms. Allocated memory is still 181.4MB. Free memory was 139.6MB in the beginning and 126.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1575.56ms. Allocated memory was 181.4MB in the beginning and 239.1MB in the end (delta: 57.7MB). Free memory was 126.0MB in the beginning and 179.5MB in the end (delta: -53.6MB). Peak memory consumption was 5.1MB. 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: 944]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int global; VAL [global=0] [L918] 0 pthread_mutex_t gm = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [global=0, gm={2:0}] [L927] 0 void (*f)() = good; VAL [={-1:0}, global=0, gm={2:0}] [L928] 0 pthread_mutex_t fm = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [={-1:0}, fm={3:0}, global=0, gm={2:0}] [L938] 0 pthread_t id; VAL [={-1:0}, fm={3:0}, global=0, gm={2:0}, id={5:0}] [L939] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [={-1:0}, fm={3:0}, global=0, gm={2:0}, id={5:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L930] 1 void (*g)(); VAL [={-1:0}, arg={0:0}, arg={0:0}, fm={3:0}, global=0, gm={2:0}] [L941] 0 f = bad VAL [={-1:2}, fm={3:0}, global=0, gm={2:0}, id={5:0}] [L932] 1 g = f VAL [={-1:2}, ={-1:2}, arg={0:0}, arg={0:0}, fm={3:0}, global=0, gm={2:0}] [L934] CALL 1 g() [L920] 1 global++ VAL [={-1:2}, fm={3:0}, global=1, global++=25, global++=0, gm={2:0}] [L944] 0 printf("global: %d\n", global) VAL [={-1:2}, fm={3:0}, global=1, gm={2:0}, id={5:0}] Now there is a data race on ~global~0 between C: global++ [920] and C: printf("global: %d\n", global) [944] - UnprovableResult [Line: 941]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 939]: 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: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: 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, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 1717 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 809 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 912 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1161occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 865 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-09 01:57:51,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...