/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-MCRwithDepranks-BasicCegarLoop.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-10 02:39:30,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 02:39:30,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 02:39:30,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 02:39:30,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 02:39:30,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 02:39:30,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 02:39:30,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 02:39:30,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 02:39:30,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 02:39:30,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 02:39:30,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 02:39:30,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 02:39:30,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 02:39:30,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 02:39:30,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 02:39:30,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 02:39:30,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 02:39:30,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 02:39:30,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 02:39:30,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 02:39:30,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 02:39:30,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 02:39:30,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 02:39:30,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 02:39:30,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 02:39:30,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 02:39:30,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 02:39:30,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 02:39:30,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 02:39:30,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 02:39:30,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 02:39:30,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 02:39:30,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 02:39:30,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 02:39:30,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 02:39:30,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 02:39:30,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 02:39:30,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 02:39:30,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 02:39:30,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 02:39:30,225 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-MCRwithDepranks-BasicCegarLoop.epf [2022-02-10 02:39:30,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 02:39:30,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 02:39:30,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 02:39:30,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 02:39:30,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 02:39:30,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 02:39:30,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 02:39:30,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 02:39:30,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 02:39:30,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 02:39:30,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 02:39:30,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 02:39:30,247 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 02:39:30,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 02:39:30,248 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-10 02:39:30,248 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-10 02:39:30,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 02:39:30,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 02:39:30,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 02:39:30,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 02:39:30,512 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 02:39:30,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i [2022-02-10 02:39:30,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be4f38a7/60bae693126c4f71b8d848a1e6a5ac58/FLAGe90846458 [2022-02-10 02:39:31,127 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 02:39:31,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i [2022-02-10 02:39:31,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be4f38a7/60bae693126c4f71b8d848a1e6a5ac58/FLAGe90846458 [2022-02-10 02:39:31,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be4f38a7/60bae693126c4f71b8d848a1e6a5ac58 [2022-02-10 02:39:31,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 02:39:31,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 02:39:31,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 02:39:31,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 02:39:31,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 02:39:31,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 02:39:31" (1/1) ... [2022-02-10 02:39:31,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfe5e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:31, skipping insertion in model container [2022-02-10 02:39:31,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 02:39:31" (1/1) ... [2022-02-10 02:39:31,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 02:39:31,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 02:39:31,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 02:39:32,000 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 02:39:32,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 02:39:32,090 INFO L208 MainTranslator]: Completed translation [2022-02-10 02:39:32,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32 WrapperNode [2022-02-10 02:39:32,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 02:39:32,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 02:39:32,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 02:39:32,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 02:39:32,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,150 INFO L137 Inliner]: procedures = 262, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2022-02-10 02:39:32,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 02:39:32,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 02:39:32,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 02:39:32,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 02:39:32,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 02:39:32,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 02:39:32,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 02:39:32,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 02:39:32,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (1/1) ... [2022-02-10 02:39:32,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 02:39:32,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 02:39:32,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-10 02:39:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-10 02:39:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 02:39:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 02:39:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-10 02:39:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 02:39:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-10 02:39:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 02:39:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-10 02:39:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-10 02:39:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 02:39:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 02:39:32,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 02:39:32,268 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 02:39:32,384 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 02:39:32,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 02:39:32,651 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 02:39:32,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 02:39:32,658 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 02:39:32,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 02:39:32 BoogieIcfgContainer [2022-02-10 02:39:32,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 02:39:32,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 02:39:32,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 02:39:32,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 02:39:32,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 02:39:31" (1/3) ... [2022-02-10 02:39:32,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a75600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 02:39:32, skipping insertion in model container [2022-02-10 02:39:32,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 02:39:32" (2/3) ... [2022-02-10 02:39:32,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a75600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 02:39:32, skipping insertion in model container [2022-02-10 02:39:32,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 02:39:32" (3/3) ... [2022-02-10 02:39:32,670 INFO L111 eAbstractionObserver]: Analyzing ICFG 04-mutex_12-ptr_nr.i [2022-02-10 02:39:32,675 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 02:39:32,675 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 02:39:32,675 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-02-10 02:39:32,675 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 02:39:32,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,737 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,738 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,739 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,741 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,741 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,742 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,743 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,744 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,745 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,745 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,745 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,746 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,746 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,746 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,746 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,747 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,747 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,747 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,747 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,750 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,750 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,751 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,751 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,753 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,753 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,754 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,755 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,756 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,757 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,758 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,758 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,760 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,761 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,762 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,763 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,764 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,780 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,780 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,780 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:39:32,786 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-10 02:39:32,837 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 02:39:32,845 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-10 02:39:32,846 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-10 02:39:32,861 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 94 transitions, 196 flow [2022-02-10 02:39:32,942 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 776 states, 765 states have (on average 1.9150326797385622) internal successors, (1465), 775 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:40,853 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 197804 transitions and produced 116555 states. [2022-02-10 02:39:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 116555 states, 101014 states have (on average 1.4635001088957966) internal successors, (147834), 116554 states have internal predecessors, (147834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-10 02:39:41,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:41,909 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-10 02:39:41,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -590123513, now seen corresponding path program 1 times [2022-02-10 02:39:41,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:41,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11064040] [2022-02-10 02:39:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:41,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:42,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:42,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11064040] [2022-02-10 02:39:42,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11064040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:42,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:42,264 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 02:39:42,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052433266] [2022-02-10 02:39:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:42,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 02:39:42,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 02:39:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 02:39:43,357 INFO L87 Difference]: Start difference. First operand has 116555 states, 101014 states have (on average 1.4635001088957966) internal successors, (147834), 116554 states have internal predecessors, (147834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.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-10 02:39:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:46,877 INFO L93 Difference]: Finished difference Result 115793 states and 147031 transitions. [2022-02-10 02:39:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 02:39:46,880 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 42 [2022-02-10 02:39:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:47,353 INFO L225 Difference]: With dead ends: 115793 [2022-02-10 02:39:47,354 INFO L226 Difference]: Without dead ends: 78509 [2022-02-10 02:39:47,355 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-10 02:39:47,358 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 76 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:47,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 203 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:39:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78509 states. [2022-02-10 02:39:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78509 to 817. [2022-02-10 02:39:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 785 states have (on average 1.537579617834395) internal successors, (1207), 816 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1207 transitions. [2022-02-10 02:39:48,304 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1207 transitions. Word has length 42 [2022-02-10 02:39:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:48,306 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1207 transitions. [2022-02-10 02:39:48,306 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-10 02:39:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1207 transitions. [2022-02-10 02:39:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-10 02:39:48,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:48,311 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-10 02:39:48,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 02:39:48,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:48,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1345586986, now seen corresponding path program 1 times [2022-02-10 02:39:48,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:48,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239618314] [2022-02-10 02:39:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:48,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:48,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:48,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239618314] [2022-02-10 02:39:48,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239618314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:48,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:48,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 02:39:48,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604449079] [2022-02-10 02:39:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:48,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 02:39:48,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 02:39:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 02:39:48,460 INFO L87 Difference]: Start difference. First operand 817 states and 1207 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-10 02:39:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:48,712 INFO L93 Difference]: Finished difference Result 931 states and 1395 transitions. [2022-02-10 02:39:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 02:39:48,713 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 42 [2022-02-10 02:39:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:48,716 INFO L225 Difference]: With dead ends: 931 [2022-02-10 02:39:48,716 INFO L226 Difference]: Without dead ends: 931 [2022-02-10 02:39:48,717 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-10 02:39:48,718 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 56 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:48,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 223 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:39:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-10 02:39:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 878. [2022-02-10 02:39:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 853 states have (on average 1.5474794841735053) internal successors, (1320), 877 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1320 transitions. [2022-02-10 02:39:48,737 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1320 transitions. Word has length 42 [2022-02-10 02:39:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:48,738 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1320 transitions. [2022-02-10 02:39:48,738 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-10 02:39:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1320 transitions. [2022-02-10 02:39:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-10 02:39:48,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:48,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:48,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 02:39:48,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1133906515, now seen corresponding path program 1 times [2022-02-10 02:39:48,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:48,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408967342] [2022-02-10 02:39:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:48,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:48,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:48,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408967342] [2022-02-10 02:39:48,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408967342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:48,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:48,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 02:39:48,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165686696] [2022-02-10 02:39:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:48,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 02:39:48,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 02:39:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 02:39:48,893 INFO L87 Difference]: Start difference. First operand 878 states and 1320 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:49,158 INFO L93 Difference]: Finished difference Result 937 states and 1412 transitions. [2022-02-10 02:39:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 02:39:49,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2022-02-10 02:39:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:49,162 INFO L225 Difference]: With dead ends: 937 [2022-02-10 02:39:49,162 INFO L226 Difference]: Without dead ends: 937 [2022-02-10 02:39:49,162 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-10 02:39:49,165 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:49,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 173 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:39:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-02-10 02:39:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 919. [2022-02-10 02:39:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 894 states have (on average 1.563758389261745) internal successors, (1398), 918 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1398 transitions. [2022-02-10 02:39:49,191 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1398 transitions. Word has length 49 [2022-02-10 02:39:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:49,191 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1398 transitions. [2022-02-10 02:39:49,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1398 transitions. [2022-02-10 02:39:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-10 02:39:49,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:49,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:49,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 02:39:49,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash -417702445, now seen corresponding path program 1 times [2022-02-10 02:39:49,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:49,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88505623] [2022-02-10 02:39:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:49,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:49,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:49,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88505623] [2022-02-10 02:39:49,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88505623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:49,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:49,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 02:39:49,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904785739] [2022-02-10 02:39:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:49,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 02:39:49,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:49,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 02:39:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 02:39:49,291 INFO L87 Difference]: Start difference. First operand 919 states and 1398 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:49,488 INFO L93 Difference]: Finished difference Result 1058 states and 1618 transitions. [2022-02-10 02:39:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 02:39:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2022-02-10 02:39:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:49,494 INFO L225 Difference]: With dead ends: 1058 [2022-02-10 02:39:49,494 INFO L226 Difference]: Without dead ends: 930 [2022-02-10 02:39:49,494 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-10 02:39:49,495 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 54 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:49,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 219 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:39:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-02-10 02:39:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 897. [2022-02-10 02:39:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 877 states have (on average 1.588369441277081) internal successors, (1393), 896 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1393 transitions. [2022-02-10 02:39:49,509 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1393 transitions. Word has length 49 [2022-02-10 02:39:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:49,509 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1393 transitions. [2022-02-10 02:39:49,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1393 transitions. [2022-02-10 02:39:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-10 02:39:49,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:49,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:49,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 02:39:49,511 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1926254390, now seen corresponding path program 1 times [2022-02-10 02:39:49,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:49,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554276113] [2022-02-10 02:39:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:49,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:49,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:49,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554276113] [2022-02-10 02:39:49,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554276113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:49,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:49,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 02:39:49,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103236946] [2022-02-10 02:39:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:49,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 02:39:49,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:49,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 02:39:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 02:39:49,593 INFO L87 Difference]: Start difference. First operand 897 states and 1393 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:49,605 INFO L93 Difference]: Finished difference Result 296 states and 400 transitions. [2022-02-10 02:39:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 02:39:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2022-02-10 02:39:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:49,606 INFO L225 Difference]: With dead ends: 296 [2022-02-10 02:39:49,606 INFO L226 Difference]: Without dead ends: 294 [2022-02-10 02:39:49,607 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-10 02:39:49,608 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:49,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 124 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 02:39:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-02-10 02:39:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-02-10 02:39:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 291 states have (on average 1.3676975945017182) internal successors, (398), 293 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2022-02-10 02:39:49,613 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 55 [2022-02-10 02:39:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:49,614 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2022-02-10 02:39:49,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2022-02-10 02:39:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-10 02:39:49,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:49,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:49,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 02:39:49,616 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2065004344, now seen corresponding path program 1 times [2022-02-10 02:39:49,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:49,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625572857] [2022-02-10 02:39:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:49,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:49,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:49,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625572857] [2022-02-10 02:39:49,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625572857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:49,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:49,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-10 02:39:49,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940016249] [2022-02-10 02:39:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:49,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 02:39:49,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 02:39:49,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-10 02:39:49,757 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:49,879 INFO L93 Difference]: Finished difference Result 308 states and 419 transitions. [2022-02-10 02:39:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 02:39:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2022-02-10 02:39:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:49,881 INFO L225 Difference]: With dead ends: 308 [2022-02-10 02:39:49,881 INFO L226 Difference]: Without dead ends: 260 [2022-02-10 02:39:49,881 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-10 02:39:49,882 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:49,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 227 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:39:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-10 02:39:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-02-10 02:39:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 250 states have (on average 1.444) internal successors, (361), 252 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 361 transitions. [2022-02-10 02:39:49,888 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 361 transitions. Word has length 58 [2022-02-10 02:39:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:49,889 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 361 transitions. [2022-02-10 02:39:49,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 361 transitions. [2022-02-10 02:39:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 02:39:49,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:49,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:49,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 02:39:49,890 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 514571966, now seen corresponding path program 1 times [2022-02-10 02:39:49,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:49,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609773395] [2022-02-10 02:39:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:49,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:50,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:50,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609773395] [2022-02-10 02:39:50,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609773395] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:50,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:50,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 02:39:50,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041268183] [2022-02-10 02:39:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:50,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:39:50,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:39:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:39:50,237 INFO L87 Difference]: Start difference. First operand 253 states and 361 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:50,602 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2022-02-10 02:39:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 02:39:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2022-02-10 02:39:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:50,605 INFO L225 Difference]: With dead ends: 329 [2022-02-10 02:39:50,605 INFO L226 Difference]: Without dead ends: 310 [2022-02-10 02:39:50,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-02-10 02:39:50,606 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 250 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:50,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 288 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 02:39:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-02-10 02:39:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 289. [2022-02-10 02:39:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 286 states have (on average 1.43006993006993) internal successors, (409), 288 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-02-10 02:39:50,611 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 71 [2022-02-10 02:39:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:50,611 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-02-10 02:39:50,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-02-10 02:39:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 02:39:50,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:50,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:50,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 02:39:50,612 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash 504127906, now seen corresponding path program 1 times [2022-02-10 02:39:50,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:50,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626326239] [2022-02-10 02:39:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:50,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:50,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:50,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626326239] [2022-02-10 02:39:50,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626326239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:50,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:50,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 02:39:50,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514958959] [2022-02-10 02:39:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:50,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:39:50,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:39:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:39:50,788 INFO L87 Difference]: Start difference. First operand 289 states and 409 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:51,078 INFO L93 Difference]: Finished difference Result 280 states and 392 transitions. [2022-02-10 02:39:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 02:39:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2022-02-10 02:39:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:51,079 INFO L225 Difference]: With dead ends: 280 [2022-02-10 02:39:51,079 INFO L226 Difference]: Without dead ends: 152 [2022-02-10 02:39:51,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-02-10 02:39:51,080 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 192 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:51,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 301 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:39:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-10 02:39:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2022-02-10 02:39:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 135 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2022-02-10 02:39:51,083 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 71 [2022-02-10 02:39:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:51,084 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2022-02-10 02:39:51,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2022-02-10 02:39:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 02:39:51,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:51,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:51,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 02:39:51,085 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1532826764, now seen corresponding path program 2 times [2022-02-10 02:39:51,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:51,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348549582] [2022-02-10 02:39:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:51,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:51,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:51,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348549582] [2022-02-10 02:39:51,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348549582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:51,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:51,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 02:39:51,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559041494] [2022-02-10 02:39:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:51,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:39:51,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:39:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:39:51,321 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:51,714 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2022-02-10 02:39:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 02:39:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2022-02-10 02:39:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:51,715 INFO L225 Difference]: With dead ends: 172 [2022-02-10 02:39:51,715 INFO L226 Difference]: Without dead ends: 118 [2022-02-10 02:39:51,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2022-02-10 02:39:51,717 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:51,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 329 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 02:39:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-10 02:39:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-10 02:39:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.264957264957265) internal successors, (148), 117 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2022-02-10 02:39:51,726 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 71 [2022-02-10 02:39:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:51,726 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2022-02-10 02:39:51,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2022-02-10 02:39:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-10 02:39:51,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:39:51,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:51,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 02:39:51,731 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-02-10 02:39:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:39:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash 407858586, now seen corresponding path program 3 times [2022-02-10 02:39:51,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:39:51,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101359339] [2022-02-10 02:39:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:39:51,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:39:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:39:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 02:39:51,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:39:51,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101359339] [2022-02-10 02:39:51,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101359339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:39:51,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:39:51,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 02:39:51,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016858245] [2022-02-10 02:39:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:39:51,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:39:51,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:39:51,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:39:51,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:39:51,929 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:39:52,157 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2022-02-10 02:39:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 02:39:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 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 71 [2022-02-10 02:39:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:39:52,158 INFO L225 Difference]: With dead ends: 108 [2022-02-10 02:39:52,158 INFO L226 Difference]: Without dead ends: 0 [2022-02-10 02:39:52,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-02-10 02:39:52,159 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 126 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:39:52,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 201 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:39:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-10 02:39:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-10 02:39:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-10 02:39:52,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2022-02-10 02:39:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:39:52,161 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-10 02:39:52,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:39:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-10 02:39:52,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-10 02:39:52,163 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-02-10 02:39:52,164 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-02-10 02:39:52,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 02:39:52,166 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:39:52,169 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 02:39:52,169 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 02:39:52,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 02:39:52 BasicIcfg [2022-02-10 02:39:52,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 02:39:52,172 INFO L158 Benchmark]: Toolchain (without parser) took 20609.18ms. Allocated memory was 176.2MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 123.5MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 704.4MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,172 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 02:39:52,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.54ms. Allocated memory was 176.2MB in the beginning and 212.9MB in the end (delta: 36.7MB). Free memory was 123.2MB in the beginning and 173.5MB in the end (delta: -50.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.83ms. Allocated memory is still 212.9MB. Free memory was 173.5MB in the beginning and 171.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,173 INFO L158 Benchmark]: Boogie Preprocessor took 45.53ms. Allocated memory is still 212.9MB. Free memory was 171.0MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,173 INFO L158 Benchmark]: RCFGBuilder took 460.45ms. Allocated memory is still 212.9MB. Free memory was 169.4MB in the beginning and 154.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,173 INFO L158 Benchmark]: TraceAbstraction took 19509.87ms. Allocated memory was 212.9MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 154.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 699.1MB. Max. memory is 8.0GB. [2022-02-10 02:39:52,174 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.17ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 525.54ms. Allocated memory was 176.2MB in the beginning and 212.9MB in the end (delta: 36.7MB). Free memory was 123.2MB in the beginning and 173.5MB in the end (delta: -50.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.83ms. Allocated memory is still 212.9MB. Free memory was 173.5MB in the beginning and 171.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.53ms. Allocated memory is still 212.9MB. Free memory was 171.0MB in the beginning and 169.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 460.45ms. Allocated memory is still 212.9MB. Free memory was 169.4MB in the beginning and 154.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19509.87ms. Allocated memory was 212.9MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 154.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 699.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0 - 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 - PositiveResult [Line: 931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 933]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 923]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 121 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, PartialOrderReductionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1048 mSDsluCounter, 2288 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1460 mSDsCounter, 327 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2114 IncrementalHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 327 mSolverCounterUnsat, 841 mSDtfsCounter, 2114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116555occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 77840 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 569 ConstructedInterpolants, 0 QuantifiedInterpolants, 2782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-10 02:39:52,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...