/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/06-symbeq_09-tricky_address4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 01:58:28,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 01:58:28,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 01:58:28,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 01:58:28,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 01:58:28,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 01:58:28,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 01:58:28,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 01:58:28,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 01:58:28,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 01:58:28,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 01:58:28,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 01:58:28,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 01:58:28,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 01:58:28,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 01:58:28,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 01:58:28,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 01:58:28,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 01:58:28,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 01:58:28,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 01:58:28,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 01:58:28,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 01:58:28,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 01:58:28,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 01:58:28,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 01:58:28,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 01:58:28,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 01:58:28,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 01:58:28,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 01:58:28,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 01:58:28,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 01:58:28,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 01:58:28,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 01:58:28,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 01:58:28,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 01:58:28,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 01:58:28,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 01:58:28,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 01:58:28,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 01:58:28,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 01:58:28,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 01:58:28,156 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:58:28,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 01:58:28,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 01:58:28,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 01:58:28,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 01:58:28,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 01:58:28,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 01:58:28,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 01:58:28,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 01:58:28,182 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 01:58:28,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 01:58:28,182 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 01:58:28,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 01:58:28,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:58:28,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 01:58:28,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 01:58:28,184 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:58:28,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 01:58:28,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 01:58:28,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 01:58:28,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 01:58:28,384 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 01:58:28,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.i [2022-02-09 01:58:28,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7eb95cac/992ca5219b694e538d258a317ece1d85/FLAGc9a5b244e [2022-02-09 01:58:28,880 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 01:58:28,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.i [2022-02-09 01:58:28,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7eb95cac/992ca5219b694e538d258a317ece1d85/FLAGc9a5b244e [2022-02-09 01:58:29,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7eb95cac/992ca5219b694e538d258a317ece1d85 [2022-02-09 01:58:29,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 01:58:29,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 01:58:29,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 01:58:29,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 01:58:29,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 01:58:29,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:29,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df84a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29, skipping insertion in model container [2022-02-09 01:58:29,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:29,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 01:58:29,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 01:58:29,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:58:29,852 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 01:58:29,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 01:58:29,937 INFO L208 MainTranslator]: Completed translation [2022-02-09 01:58:29,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29 WrapperNode [2022-02-09 01:58:29,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 01:58:29,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 01:58:29,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 01:58:29,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 01:58:29,944 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:58:29" (1/1) ... [2022-02-09 01:58:29,967 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:58:29" (1/1) ... [2022-02-09 01:58:29,985 INFO L137 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-02-09 01:58:29,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 01:58:29,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 01:58:29,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 01:58:29,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 01:58:29,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:29,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 01:58:30,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 01:58:30,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 01:58:30,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 01:58:30,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (1/1) ... [2022-02-09 01:58:30,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 01:58:30,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:30,053 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:58:30,060 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:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-09 01:58:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-09 01:58:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 01:58:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 01:58:30,084 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:58:30,172 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 01:58:30,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 01:58:30,379 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 01:58:30,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 01:58:30,385 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-09 01:58:30,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:58:30 BoogieIcfgContainer [2022-02-09 01:58:30,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 01:58:30,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 01:58:30,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 01:58:30,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 01:58:30,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 01:58:29" (1/3) ... [2022-02-09 01:58:30,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38859eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:58:30, skipping insertion in model container [2022-02-09 01:58:30,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 01:58:29" (2/3) ... [2022-02-09 01:58:30,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38859eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 01:58:30, skipping insertion in model container [2022-02-09 01:58:30,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 01:58:30" (3/3) ... [2022-02-09 01:58:30,394 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2022-02-09 01:58:30,397 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 01:58:30,397 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 01:58:30,397 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-09 01:58:30,398 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 01:58:30,422 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:58:30,422 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:58:30,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,423 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:58:30,423 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:58:30,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 01:58:30,445 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 01:58:30,472 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 01:58:30,476 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:58:30,476 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-09 01:58:30,482 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 106 transitions, 217 flow [2022-02-09 01:58:30,545 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1195 states, 1187 states have (on average 1.9553496208930077) internal successors, (2321), 1194 states have internal predecessors, (2321), 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:58:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 1195 states, 1187 states have (on average 1.9553496208930077) internal successors, (2321), 1194 states have internal predecessors, (2321), 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:58:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-09 01:58:30,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:30,555 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] [2022-02-09 01:58:30,556 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1316832337, now seen corresponding path program 1 times [2022-02-09 01:58:30,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:30,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245647426] [2022-02-09 01:58:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:30,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:30,705 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:58:30,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:30,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245647426] [2022-02-09 01:58:30,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245647426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:30,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:30,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 01:58:30,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655935364] [2022-02-09 01:58:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:30,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 01:58:30,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 01:58:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 01:58:30,736 INFO L87 Difference]: Start difference. First operand has 1195 states, 1187 states have (on average 1.9553496208930077) internal successors, (2321), 1194 states have internal predecessors, (2321), 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:58:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:30,816 INFO L93 Difference]: Finished difference Result 1195 states and 2288 transitions. [2022-02-09 01:58:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 01:58:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-09 01:58:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:30,832 INFO L225 Difference]: With dead ends: 1195 [2022-02-09 01:58:30,832 INFO L226 Difference]: Without dead ends: 1183 [2022-02-09 01:58:30,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 01:58:30,835 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:30,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-02-09 01:58:30,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2022-02-09 01:58:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1173 states have (on average 1.9309462915601023) internal successors, (2265), 1182 states have internal predecessors, (2265), 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:58:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2265 transitions. [2022-02-09 01:58:30,926 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 2265 transitions. Word has length 37 [2022-02-09 01:58:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:30,926 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 2265 transitions. [2022-02-09 01:58:30,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:58:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 2265 transitions. [2022-02-09 01:58:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-09 01:58:30,928 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:30,929 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] [2022-02-09 01:58:30,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 01:58:30,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 900925616, now seen corresponding path program 1 times [2022-02-09 01:58:30,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:30,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59522908] [2022-02-09 01:58:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:30,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,007 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:58:31,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:31,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59522908] [2022-02-09 01:58:31,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59522908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:31,008 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:31,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 01:58:31,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775398832] [2022-02-09 01:58:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:31,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 01:58:31,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 01:58:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 01:58:31,010 INFO L87 Difference]: Start difference. First operand 1183 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:58:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:31,029 INFO L93 Difference]: Finished difference Result 1187 states and 2269 transitions. [2022-02-09 01:58:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 01:58:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-02-09 01:58:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:31,033 INFO L225 Difference]: With dead ends: 1187 [2022-02-09 01:58:31,033 INFO L226 Difference]: Without dead ends: 1187 [2022-02-09 01:58:31,033 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:58:31,034 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:31,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-02-09 01:58:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1184. [2022-02-09 01:58:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1174 states have (on average 1.93015332197615) internal successors, (2266), 1183 states have internal predecessors, (2266), 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:58:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2266 transitions. [2022-02-09 01:58:31,064 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2266 transitions. Word has length 37 [2022-02-09 01:58:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:31,065 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2266 transitions. [2022-02-09 01:58:31,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:58:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2266 transitions. [2022-02-09 01:58:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-09 01:58:31,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:31,072 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] [2022-02-09 01:58:31,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 01:58:31,073 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 438260885, now seen corresponding path program 1 times [2022-02-09 01:58:31,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:31,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804862960] [2022-02-09 01:58:31,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:31,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804862960] [2022-02-09 01:58:31,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804862960] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:31,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80826189] [2022-02-09 01:58:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:31,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:58:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-09 01:58:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-09 01:58:31,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80826189] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:31,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:31,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-09 01:58:31,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708000931] [2022-02-09 01:58:31,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:31,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 01:58:31,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 01:58:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-09 01:58:31,484 INFO L87 Difference]: Start difference. First operand 1184 states and 2266 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:58:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:31,562 INFO L93 Difference]: Finished difference Result 1194 states and 2276 transitions. [2022-02-09 01:58:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 01:58:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 42 [2022-02-09 01:58:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:31,573 INFO L225 Difference]: With dead ends: 1194 [2022-02-09 01:58:31,573 INFO L226 Difference]: Without dead ends: 1194 [2022-02-09 01:58:31,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-09 01:58:31,575 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:31,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 379 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-02-09 01:58:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2022-02-09 01:58:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1184 states have (on average 1.9222972972972974) internal successors, (2276), 1193 states have internal predecessors, (2276), 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:58:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 2276 transitions. [2022-02-09 01:58:31,600 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 2276 transitions. Word has length 42 [2022-02-09 01:58:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:31,600 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 2276 transitions. [2022-02-09 01:58:31,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:58:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 2276 transitions. [2022-02-09 01:58:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-09 01:58:31,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:31,604 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:31,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-09 01:58:31,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,824 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 432939381, now seen corresponding path program 2 times [2022-02-09 01:58:31,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:31,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301505111] [2022-02-09 01:58:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:31,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:31,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:31,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301505111] [2022-02-09 01:58:31,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301505111] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:31,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422798149] [2022-02-09 01:58:31,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:58:31,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:31,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:58:31,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-09 01:58:31,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 01:58:31,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:58:31,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 01:58:31,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:32,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:58:32,065 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-09 01:58:32,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-02-09 01:58:32,095 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-09 01:58:32,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-02-09 01:58:32,136 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-09 01:58:32,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-02-09 01:58:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-09 01:58:32,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 01:58:32,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422798149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:32,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 01:58:32,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-09 01:58:32,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993544775] [2022-02-09 01:58:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:32,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:32,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-09 01:58:32,172 INFO L87 Difference]: Start difference. First operand 1194 states and 2276 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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:58:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:32,406 INFO L93 Difference]: Finished difference Result 1474 states and 2807 transitions. [2022-02-09 01:58:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:32,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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:58:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:32,412 INFO L225 Difference]: With dead ends: 1474 [2022-02-09 01:58:32,412 INFO L226 Difference]: Without dead ends: 1474 [2022-02-09 01:58:32,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-09 01:58:32,413 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 140 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:32,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 509 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-02-09 01:58:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1214. [2022-02-09 01:58:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1206 states have (on average 1.9170812603648424) internal successors, (2312), 1213 states have internal predecessors, (2312), 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:58:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2312 transitions. [2022-02-09 01:58:32,435 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2312 transitions. Word has length 52 [2022-02-09 01:58:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:32,435 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 2312 transitions. [2022-02-09 01:58:32,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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:58:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2312 transitions. [2022-02-09 01:58:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-09 01:58:32,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:32,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:32,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-09 01:58:32,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-09 01:58:32,654 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 491733010, now seen corresponding path program 1 times [2022-02-09 01:58:32,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:32,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640322160] [2022-02-09 01:58:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:32,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:32,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:32,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640322160] [2022-02-09 01:58:32,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640322160] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:32,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354955213] [2022-02-09 01:58:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:32,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:32,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:32,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:58:32,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-09 01:58:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:32,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 01:58:32,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:32,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:32,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354955213] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:32,992 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:32,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 01:58:32,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941105484] [2022-02-09 01:58:32,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:32,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 01:58:32,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 01:58:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-09 01:58:32,993 INFO L87 Difference]: Start difference. First operand 1214 states and 2312 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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:58:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:33,135 INFO L93 Difference]: Finished difference Result 1234 states and 2332 transitions. [2022-02-09 01:58:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 01:58:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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 60 [2022-02-09 01:58:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:33,139 INFO L225 Difference]: With dead ends: 1234 [2022-02-09 01:58:33,139 INFO L226 Difference]: Without dead ends: 1234 [2022-02-09 01:58:33,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-02-09 01:58:33,140 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 37 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:33,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 659 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-02-09 01:58:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2022-02-09 01:58:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1226 states have (on average 1.902120717781403) internal successors, (2332), 1233 states have internal predecessors, (2332), 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:58:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 2332 transitions. [2022-02-09 01:58:33,161 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 2332 transitions. Word has length 60 [2022-02-09 01:58:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:33,161 INFO L470 AbstractCegarLoop]: Abstraction has 1234 states and 2332 transitions. [2022-02-09 01:58:33,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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:58:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 2332 transitions. [2022-02-09 01:58:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-09 01:58:33,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:33,162 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:33,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-09 01:58:33,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:33,378 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 656757202, now seen corresponding path program 2 times [2022-02-09 01:58:33,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:33,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662768029] [2022-02-09 01:58:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:33,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:33,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:33,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662768029] [2022-02-09 01:58:33,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662768029] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:33,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766070608] [2022-02-09 01:58:33,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 01:58:33,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:33,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:58:33,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-09 01:58:33,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 01:58:33,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 01:58:33,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 01:58:33,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:33,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 01:58:33,696 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-09 01:58:33,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-02-09 01:58:33,724 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-02-09 01:58:33,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-02-09 01:58:33,764 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-02-09 01:58:33,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-02-09 01:58:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-09 01:58:33,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 01:58:33,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766070608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:33,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 01:58:33,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-02-09 01:58:33,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236082699] [2022-02-09 01:58:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:33,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:33,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:33,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-02-09 01:58:33,787 INFO L87 Difference]: Start difference. First operand 1234 states and 2332 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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:58:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:33,947 INFO L93 Difference]: Finished difference Result 1588 states and 2987 transitions. [2022-02-09 01:58:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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 80 [2022-02-09 01:58:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:33,953 INFO L225 Difference]: With dead ends: 1588 [2022-02-09 01:58:33,953 INFO L226 Difference]: Without dead ends: 1444 [2022-02-09 01:58:33,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-02-09 01:58:33,953 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 145 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:33,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 331 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 01:58:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-02-09 01:58:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1155. [2022-02-09 01:58:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1148 states have (on average 1.8850174216027875) internal successors, (2164), 1154 states have internal predecessors, (2164), 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:58:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2164 transitions. [2022-02-09 01:58:33,973 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2164 transitions. Word has length 80 [2022-02-09 01:58:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:33,974 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 2164 transitions. [2022-02-09 01:58:33,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 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:58:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2164 transitions. [2022-02-09 01:58:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-09 01:58:33,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:33,975 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:34,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-09 01:58:34,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:34,214 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1425828848, now seen corresponding path program 1 times [2022-02-09 01:58:34,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:34,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972425841] [2022-02-09 01:58:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:34,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:34,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:34,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972425841] [2022-02-09 01:58:34,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972425841] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 01:58:34,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635509652] [2022-02-09 01:58:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:34,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:34,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 01:58:34,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 01:58:34,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-09 01:58:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:34,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-09 01:58:34,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 01:58:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:34,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 01:58:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 01:58:34,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635509652] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 01:58:34,740 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 01:58:34,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-09 01:58:34,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836925127] [2022-02-09 01:58:34,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 01:58:34,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-09 01:58:34,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-09 01:58:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-09 01:58:34,742 INFO L87 Difference]: Start difference. First operand 1155 states and 2164 transitions. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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:58:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:34,955 INFO L93 Difference]: Finished difference Result 1170 states and 2179 transitions. [2022-02-09 01:58:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 01:58:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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 84 [2022-02-09 01:58:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:34,958 INFO L225 Difference]: With dead ends: 1170 [2022-02-09 01:58:34,958 INFO L226 Difference]: Without dead ends: 1170 [2022-02-09 01:58:34,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-02-09 01:58:34,959 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 39 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:34,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 562 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 01:58:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-02-09 01:58:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2022-02-09 01:58:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1163 states have (on average 1.873602751504729) internal successors, (2179), 1169 states have internal predecessors, (2179), 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:58:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 2179 transitions. [2022-02-09 01:58:34,976 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 2179 transitions. Word has length 84 [2022-02-09 01:58:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:34,976 INFO L470 AbstractCegarLoop]: Abstraction has 1170 states and 2179 transitions. [2022-02-09 01:58:34,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 23 states have internal predecessors, (101), 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:58:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 2179 transitions. [2022-02-09 01:58:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-09 01:58:34,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:34,977 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:34,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-09 01:58:35,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 01:58:35,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2073879691, now seen corresponding path program 2 times [2022-02-09 01:58:35,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:35,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359780091] [2022-02-09 01:58:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:35,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:35,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:35,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359780091] [2022-02-09 01:58:35,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359780091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:35,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:35,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:58:35,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818443405] [2022-02-09 01:58:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:35,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:35,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:35,277 INFO L87 Difference]: Start difference. First operand 1170 states and 2179 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:58:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:35,451 INFO L93 Difference]: Finished difference Result 1591 states and 2992 transitions. [2022-02-09 01:58:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:35,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 99 [2022-02-09 01:58:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:35,456 INFO L225 Difference]: With dead ends: 1591 [2022-02-09 01:58:35,456 INFO L226 Difference]: Without dead ends: 1591 [2022-02-09 01:58:35,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:35,457 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 104 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:35,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 334 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2022-02-09 01:58:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1211. [2022-02-09 01:58:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1204 states have (on average 1.8745847176079735) internal successors, (2257), 1210 states have internal predecessors, (2257), 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:58:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2257 transitions. [2022-02-09 01:58:35,476 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2257 transitions. Word has length 99 [2022-02-09 01:58:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:35,476 INFO L470 AbstractCegarLoop]: Abstraction has 1211 states and 2257 transitions. [2022-02-09 01:58:35,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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:58:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2257 transitions. [2022-02-09 01:58:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-02-09 01:58:35,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:35,477 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:35,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-09 01:58:35,478 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1373859952, now seen corresponding path program 1 times [2022-02-09 01:58:35,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:35,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750163600] [2022-02-09 01:58:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:35,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 01:58:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-09 01:58:35,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 01:58:35,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750163600] [2022-02-09 01:58:35,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750163600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 01:58:35,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 01:58:35,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 01:58:35,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918440633] [2022-02-09 01:58:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 01:58:35,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 01:58:35,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 01:58:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 01:58:35,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:35,556 INFO L87 Difference]: Start difference. First operand 1211 states and 2257 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:58:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 01:58:35,782 INFO L93 Difference]: Finished difference Result 1534 states and 2812 transitions. [2022-02-09 01:58:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 01:58:35,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 107 [2022-02-09 01:58:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 01:58:35,787 INFO L225 Difference]: With dead ends: 1534 [2022-02-09 01:58:35,787 INFO L226 Difference]: Without dead ends: 1204 [2022-02-09 01:58:35,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 01:58:35,787 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 100 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 01:58:35,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 474 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 01:58:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-02-09 01:58:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 957. [2022-02-09 01:58:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 950 states have (on average 1.8168421052631578) internal successors, (1726), 956 states have internal predecessors, (1726), 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:58:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1726 transitions. [2022-02-09 01:58:35,802 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1726 transitions. Word has length 107 [2022-02-09 01:58:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 01:58:35,802 INFO L470 AbstractCegarLoop]: Abstraction has 957 states and 1726 transitions. [2022-02-09 01:58:35,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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:58:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1726 transitions. [2022-02-09 01:58:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-09 01:58:35,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 01:58:35,804 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:35,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-09 01:58:35,804 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-02-09 01:58:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 01:58:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1446686969, now seen corresponding path program 1 times [2022-02-09 01:58:35,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 01:58:35,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595707087] [2022-02-09 01:58:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 01:58:35,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 01:58:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:58:35,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-09 01:58:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 01:58:35,864 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-09 01:58:35,864 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-09 01:58:35,865 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2022-02-09 01:58:35,866 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2022-02-09 01:58:35,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-09 01:58:35,868 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2022-02-09 01:58:35,872 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 01:58:35,872 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 01:58:35,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 01:58:35 BasicIcfg [2022-02-09 01:58:35,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 01:58:35,904 INFO L158 Benchmark]: Toolchain (without parser) took 6677.14ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 143.7MB in the beginning and 109.4MB in the end (delta: 34.3MB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,904 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 01:58:35,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.67ms. Allocated memory is still 165.7MB. Free memory was 143.4MB in the beginning and 125.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.68ms. Allocated memory is still 165.7MB. Free memory was 125.1MB in the beginning and 122.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,905 INFO L158 Benchmark]: Boogie Preprocessor took 35.20ms. Allocated memory is still 165.7MB. Free memory was 122.4MB in the beginning and 120.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,905 INFO L158 Benchmark]: RCFGBuilder took 363.90ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 105.3MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,905 INFO L158 Benchmark]: TraceAbstraction took 5517.00ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 104.9MB in the beginning and 109.4MB in the end (delta: -4.5MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2022-02-09 01:58:35,906 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 165.7MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 710.67ms. Allocated memory is still 165.7MB. Free memory was 143.4MB in the beginning and 125.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.68ms. Allocated memory is still 165.7MB. Free memory was 125.1MB in the beginning and 122.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.20ms. Allocated memory is still 165.7MB. Free memory was 122.4MB in the beginning and 120.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 363.90ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 105.3MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5517.00ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 104.9MB in the beginning and 109.4MB in the end (delta: -4.5MB). Peak memory consumption was 70.4MB. 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: [L922-L925] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; VAL [a={1:0}] [L937] 0 int i = 0; VAL [a={1:0}, i=0] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=0] [L937] 0 i++ VAL [a={1:0}, i=1] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=1] [L937] 0 i++ VAL [a={1:0}, i=2] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=2] [L937] 0 i++ VAL [a={1:0}, i=3] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=3] [L937] 0 i++ VAL [a={1:0}, i=4] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=4] [L937] 0 i++ VAL [a={1:0}, i=5] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=5] [L937] 0 i++ VAL [a={1:0}, i=6] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=6] [L937] 0 i++ VAL [a={1:0}, i=7] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=7] [L937] 0 i++ VAL [a={1:0}, i=8] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=8] [L937] 0 i++ VAL [a={1:0}, i=9] [L937] COND TRUE 0 i < 10 VAL [a={1:0}, i=9] [L937] 0 i++ VAL [a={1:0}, i=10] [L937] COND FALSE 0 !(i < 10) VAL [a={1:0}, i=10] [L939] 0 int i = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, a={1:0}, i=1, i=10] [L940] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, a={1:0}, cond=1] [L940] RET 0 assume_abort_if_not(0 <= i && i < 10) [L941] 0 pthread_t t1; VAL [a={1:0}, i=1, i=10, t1={5:0}] [L942] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [a={1:0}, i=10, i=1, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={5:0}] [L927] 1 int i = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, a={1:0}, arg={0:0}, arg={0:0}, i=0] [L928] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) VAL [\old(cond)=1, \old(cond)=1, a={1:0}, cond=1, cond=1] [L928] RET 1 assume_abort_if_not(0 <= i && i < 9) [L929] 1 struct s *p = &a[i]; VAL [a={1:0}, arg={0:0}, arg={0:0}, i=0, p={1:0}] [L931] 1 i++ VAL [a={1:0}, arg={0:0}, arg={0:0}, i=1, p={1:0}] [L932] EXPR 1 a[i].datum VAL [a={1:0}, a[i].datum=0, arg={0:0}, arg={0:0}, i=1, p={1:0}] [L932] 1 a[i].datum++ VAL [a={1:0}, a[i].datum=0, a[i].datum++=0, arg={0:0}, arg={0:0}, i=1, p={1:0}] [L944] EXPR 0 a[i].datum VAL [a={1:0}, a[i].datum=0, i=1, i=10, t1={5:0}] [L944] 0 a[i].datum++ VAL [a={1:0}, a[i].datum=0, i=10, i=1, t1={5:0}] [L932] 1 a[i].datum++ VAL [a={1:0}, a[i].datum=0, a[i].datum++=0, a[i].datum++=281, arg={0:0}, arg={0:0}, i=1, p={1:0}] [L944] 0 a[i].datum++ VAL [a={1:0}, a[i].datum=0, i=1, i=10, t1={5:0}] Now there is a data race (on the heap) between C: a[i].datum++ [932] and C: a[i].datum++ [944] - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: 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: 932]: 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, 144 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 3539 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2393 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1249 IncrementalHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 1165 mSDtfsCounter, 1249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 483 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1234occurred in iteration=5, InterpolantAutomatonStates: 89, 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, 9 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 1999 SizeOfPredicates, 22 NumberOfNonLiveVariables, 686 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 600/1123 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:58:35,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...