/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:13:40,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:13:40,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:13:40,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:13:40,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:13:40,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:13:40,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:13:40,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:13:40,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:13:40,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:13:40,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:13:40,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:13:40,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:13:40,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:13:40,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:13:40,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:13:40,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:13:40,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:13:40,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:13:40,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:13:40,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:13:40,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:13:40,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:13:40,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:13:40,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:13:40,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:13:40,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:13:40,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:13:40,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:13:40,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:13:40,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:13:40,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:13:40,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:13:40,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:13:40,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:13:40,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:13:40,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:13:40,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:13:40,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:13:40,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:13:40,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:13:40,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 20:13:40,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:13:40,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:13:40,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:13:40,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:13:40,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:13:40,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:13:40,411 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:13:40,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:13:40,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:13:40,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:13:40,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:13:40,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:13:40,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:40,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:13:40,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:13:40,415 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 20:13:40,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:13:40,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:13:40,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:13:40,685 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:13:40,686 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:13:40,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.i [2022-03-15 20:13:40,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d524847d1/23fa62f5bf804262b5c5ce5fc8788b24/FLAG8205a629d [2022-03-15 20:13:41,241 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:13:41,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_01-list_rc.i [2022-03-15 20:13:41,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d524847d1/23fa62f5bf804262b5c5ce5fc8788b24/FLAG8205a629d [2022-03-15 20:13:41,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d524847d1/23fa62f5bf804262b5c5ce5fc8788b24 [2022-03-15 20:13:41,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:13:41,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:13:41,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:41,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:13:41,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:13:41,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:41" (1/1) ... [2022-03-15 20:13:41,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a440ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:41, skipping insertion in model container [2022-03-15 20:13:41,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:41" (1/1) ... [2022-03-15 20:13:41,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:13:41,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:13:42,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:42,239 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:13:42,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:42,347 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:13:42,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42 WrapperNode [2022-03-15 20:13:42,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:42,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:42,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:13:42,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:13:42,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,417 INFO L137 Inliner]: procedures = 368, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-03-15 20:13:42,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:42,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:13:42,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:13:42,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:13:42,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:13:42,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:13:42,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:13:42,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:13:42,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (1/1) ... [2022-03-15 20:13:42,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:42,485 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-03-15 20:13:42,496 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-03-15 20:13:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:13:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 20:13:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:13:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:13:42,524 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:13:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:13:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:13:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:13:42,526 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 20:13:42,630 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:13:42,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:13:43,017 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:13:43,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:13:43,025 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:13:43,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:43 BoogieIcfgContainer [2022-03-15 20:13:43,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:13:43,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:13:43,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:13:43,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:13:43,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:13:41" (1/3) ... [2022-03-15 20:13:43,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1897a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:43, skipping insertion in model container [2022-03-15 20:13:43,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:42" (2/3) ... [2022-03-15 20:13:43,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1897a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:43, skipping insertion in model container [2022-03-15 20:13:43,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:43" (3/3) ... [2022-03-15 20:13:43,038 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_01-list_rc.i [2022-03-15 20:13:43,044 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:13:43,044 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:13:43,044 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-15 20:13:43,045 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:13:43,101 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,102 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,103 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,104 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,105 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,106 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,107 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,151 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,151 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,156 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,156 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,156 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,159 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,160 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,161 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#in~p#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_init_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:43,178 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:13:43,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:13:43,231 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 20:13:43,231 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-03-15 20:13:43,246 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:13:43,253 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 207 transitions, 419 flow [2022-03-15 20:13:43,258 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 207 transitions, 419 flow [2022-03-15 20:13:43,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 207 transitions, 419 flow [2022-03-15 20:13:43,352 INFO L129 PetriNetUnfolder]: 0/206 cut-off events. [2022-03-15 20:13:43,352 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:13:43,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 206 events. 0/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:13:43,361 INFO L116 LiptonReduction]: Number of co-enabled transitions 4288 [2022-03-15 20:14:02,479 WARN L228 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 221 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:14,132 WARN L228 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 197 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:23,298 WARN L228 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 260 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:37,397 WARN L228 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:46,077 WARN L228 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 260 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:14:58,546 WARN L228 SmtUtils]: Spent 12.47s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:19,918 WARN L228 SmtUtils]: Spent 21.34s on a formula simplification. DAG size of input: 283 DAG size of output: 281 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:30,602 WARN L228 SmtUtils]: Spent 10.68s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:24,179 WARN L228 SmtUtils]: Spent 53.57s on a formula simplification. DAG size of input: 283 DAG size of output: 281 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:49,087 WARN L228 SmtUtils]: Spent 24.91s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:49,091 INFO L131 LiptonReduction]: Checked pairs total: 35398 [2022-03-15 20:16:49,092 INFO L133 LiptonReduction]: Total number of compositions: 173 [2022-03-15 20:16:49,102 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 74 transitions, 153 flow [2022-03-15 20:16:49,165 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 928 states, 889 states have (on average 2.003374578177728) internal successors, (1781), 927 states have internal predecessors, (1781), 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-03-15 20:16:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 928 states, 889 states have (on average 2.003374578177728) internal successors, (1781), 927 states have internal predecessors, (1781), 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-03-15 20:16:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:16:49,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:49,175 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:16:49,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 687, now seen corresponding path program 1 times [2022-03-15 20:16:49,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:49,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527087599] [2022-03-15 20:16:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:49,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:49,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527087599] [2022-03-15 20:16:49,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527087599] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:49,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:49,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:16:49,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926578873] [2022-03-15 20:16:49,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:49,301 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:49,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:16:49,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:49,308 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:49,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:16:49,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:16:49,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:16:49,334 INFO L87 Difference]: Start difference. First operand has 928 states, 889 states have (on average 2.003374578177728) internal successors, (1781), 927 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-03-15 20:16:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:49,449 INFO L93 Difference]: Finished difference Result 920 states and 1773 transitions. [2022-03-15 20:16:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:16:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-03-15 20:16:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:49,466 INFO L225 Difference]: With dead ends: 920 [2022-03-15 20:16:49,467 INFO L226 Difference]: Without dead ends: 920 [2022-03-15 20:16:49,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:16:49,472 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:49,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:16:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-03-15 20:16:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2022-03-15 20:16:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 889 states have (on average 1.9943757030371203) internal successors, (1773), 919 states have internal predecessors, (1773), 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-03-15 20:16:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1773 transitions. [2022-03-15 20:16:49,579 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1773 transitions. Word has length 1 [2022-03-15 20:16:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:49,579 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1773 transitions. [2022-03-15 20:16:49,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-03-15 20:16:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1773 transitions. [2022-03-15 20:16:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:16:49,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:49,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:16:49,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:16:49,580 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:49,582 INFO L85 PathProgramCache]: Analyzing trace with hash 651315109, now seen corresponding path program 1 times [2022-03-15 20:16:49,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:49,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130537285] [2022-03-15 20:16:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:49,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:49,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130537285] [2022-03-15 20:16:49,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130537285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:49,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:49,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:16:49,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884569065] [2022-03-15 20:16:49,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:49,827 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:49,828 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:16:49,828 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:49,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:49,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:16:49,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:16:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:16:49,830 INFO L87 Difference]: Start difference. First operand 920 states and 1773 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-15 20:16:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:49,897 INFO L93 Difference]: Finished difference Result 836 states and 1608 transitions. [2022-03-15 20:16:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:16:49,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-03-15 20:16:49,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:49,903 INFO L225 Difference]: With dead ends: 836 [2022-03-15 20:16:49,903 INFO L226 Difference]: Without dead ends: 836 [2022-03-15 20:16:49,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:16:49,910 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:49,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 38 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:16:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-03-15 20:16:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2022-03-15 20:16:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 819 states have (on average 1.9633699633699633) internal successors, (1608), 835 states have internal predecessors, (1608), 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-03-15 20:16:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1608 transitions. [2022-03-15 20:16:49,963 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1608 transitions. Word has length 5 [2022-03-15 20:16:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:49,964 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1608 transitions. [2022-03-15 20:16:49,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-15 20:16:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1608 transitions. [2022-03-15 20:16:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:16:49,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:49,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:49,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:16:49,965 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1782968845, now seen corresponding path program 1 times [2022-03-15 20:16:49,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:49,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955376697] [2022-03-15 20:16:49,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:50,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:50,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955376697] [2022-03-15 20:16:50,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955376697] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:50,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:50,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:16:50,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937986532] [2022-03-15 20:16:50,152 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:50,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:50,155 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 20:16:50,155 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:50,155 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:50,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:16:50,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:16:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:16:50,157 INFO L87 Difference]: Start difference. First operand 836 states and 1608 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-03-15 20:16:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:50,554 INFO L93 Difference]: Finished difference Result 891 states and 1714 transitions. [2022-03-15 20:16:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:16:50,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-03-15 20:16:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:50,559 INFO L225 Difference]: With dead ends: 891 [2022-03-15 20:16:50,559 INFO L226 Difference]: Without dead ends: 891 [2022-03-15 20:16:50,559 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-03-15 20:16:50,560 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:50,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 61 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:16:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-03-15 20:16:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2022-03-15 20:16:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 874 states have (on average 1.9610983981693364) internal successors, (1714), 890 states have internal predecessors, (1714), 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-03-15 20:16:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1714 transitions. [2022-03-15 20:16:50,585 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1714 transitions. Word has length 9 [2022-03-15 20:16:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:50,585 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1714 transitions. [2022-03-15 20:16:50,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-03-15 20:16:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1714 transitions. [2022-03-15 20:16:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:16:50,586 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:50,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:50,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:16:50,587 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 254229496, now seen corresponding path program 1 times [2022-03-15 20:16:50,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:50,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287890001] [2022-03-15 20:16:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:50,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:50,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287890001] [2022-03-15 20:16:50,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287890001] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:50,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:50,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:16:50,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [965750224] [2022-03-15 20:16:50,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:50,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:50,736 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:16:50,736 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:50,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:50,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:16:50,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:16:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:16:50,737 INFO L87 Difference]: Start difference. First operand 891 states and 1714 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-03-15 20:16:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:51,389 INFO L93 Difference]: Finished difference Result 1450 states and 2770 transitions. [2022-03-15 20:16:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:16:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-03-15 20:16:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:51,397 INFO L225 Difference]: With dead ends: 1450 [2022-03-15 20:16:51,397 INFO L226 Difference]: Without dead ends: 1450 [2022-03-15 20:16:51,397 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-03-15 20:16:51,398 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:51,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 66 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:16:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-03-15 20:16:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1002. [2022-03-15 20:16:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 988 states have (on average 1.95748987854251) internal successors, (1934), 1001 states have internal predecessors, (1934), 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-03-15 20:16:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1934 transitions. [2022-03-15 20:16:51,427 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1934 transitions. Word has length 11 [2022-03-15 20:16:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:51,427 INFO L470 AbstractCegarLoop]: Abstraction has 1002 states and 1934 transitions. [2022-03-15 20:16:51,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-03-15 20:16:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1934 transitions. [2022-03-15 20:16:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:16:51,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:51,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:51,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:16:51,430 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1681572900, now seen corresponding path program 1 times [2022-03-15 20:16:51,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:51,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43246696] [2022-03-15 20:16:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:51,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:51,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43246696] [2022-03-15 20:16:51,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43246696] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:51,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:51,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:16:51,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33734200] [2022-03-15 20:16:51,618 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:51,620 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:51,623 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 42 transitions. [2022-03-15 20:16:51,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:51,764 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:51,765 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:51,773 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:51,773 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:51,845 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:51,846 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:51,852 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:51,853 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:51,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13492#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))] [2022-03-15 20:16:51,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:16:51,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:16:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:16:51,943 INFO L87 Difference]: Start difference. First operand 1002 states and 1934 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-03-15 20:16:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:52,706 INFO L93 Difference]: Finished difference Result 1028 states and 1948 transitions. [2022-03-15 20:16:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:16:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 14 [2022-03-15 20:16:52,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:52,711 INFO L225 Difference]: With dead ends: 1028 [2022-03-15 20:16:52,711 INFO L226 Difference]: Without dead ends: 1028 [2022-03-15 20:16:52,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:16:52,712 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 276 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:52,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 87 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:16:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-03-15 20:16:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 964. [2022-03-15 20:16:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 951 states have (on average 1.953732912723449) internal successors, (1858), 963 states have internal predecessors, (1858), 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-03-15 20:16:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1858 transitions. [2022-03-15 20:16:52,734 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1858 transitions. Word has length 14 [2022-03-15 20:16:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:52,734 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1858 transitions. [2022-03-15 20:16:52,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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-03-15 20:16:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1858 transitions. [2022-03-15 20:16:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:16:52,735 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:52,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:52,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:16:52,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 995844485, now seen corresponding path program 1 times [2022-03-15 20:16:52,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:52,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919162483] [2022-03-15 20:16:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:52,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:52,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919162483] [2022-03-15 20:16:52,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919162483] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:52,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:52,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:16:52,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441975786] [2022-03-15 20:16:52,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:52,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:52,886 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2022-03-15 20:16:52,886 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:52,895 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:52,895 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:52,898 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:52,899 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:52,940 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:52,941 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:52,944 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:52,945 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:52,980 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16481#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))] [2022-03-15 20:16:52,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:16:52,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:52,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:16:52,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:16:52,982 INFO L87 Difference]: Start difference. First operand 964 states and 1858 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03-15 20:16:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:53,964 INFO L93 Difference]: Finished difference Result 1379 states and 2594 transitions. [2022-03-15 20:16:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:16:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 14 [2022-03-15 20:16:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:53,971 INFO L225 Difference]: With dead ends: 1379 [2022-03-15 20:16:53,971 INFO L226 Difference]: Without dead ends: 1379 [2022-03-15 20:16:53,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:16:53,973 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 403 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:53,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 56 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:16:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-03-15 20:16:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 968. [2022-03-15 20:16:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 955 states have (on average 1.9539267015706807) internal successors, (1866), 967 states have internal predecessors, (1866), 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-03-15 20:16:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1866 transitions. [2022-03-15 20:16:53,999 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1866 transitions. Word has length 14 [2022-03-15 20:16:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:53,999 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1866 transitions. [2022-03-15 20:16:53,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-03-15 20:16:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1866 transitions. [2022-03-15 20:16:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:16:54,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:54,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:54,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:16:54,001 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2074960643, now seen corresponding path program 2 times [2022-03-15 20:16:54,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:54,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418638626] [2022-03-15 20:16:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:54,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:54,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:54,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418638626] [2022-03-15 20:16:54,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418638626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:54,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:54,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:16:54,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512794701] [2022-03-15 20:16:54,164 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:54,166 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:54,169 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2022-03-15 20:16:54,169 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:54,185 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:54,186 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:54,190 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:54,191 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:54,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [19837#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 19838#(not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)), 19836#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)), 19835#(and (not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0))] [2022-03-15 20:16:54,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:16:54,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:54,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:16:54,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:16:54,528 INFO L87 Difference]: Start difference. First operand 968 states and 1866 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-03-15 20:16:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:55,823 INFO L93 Difference]: Finished difference Result 1359 states and 2558 transitions. [2022-03-15 20:16:55,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:16:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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 14 [2022-03-15 20:16:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:55,828 INFO L225 Difference]: With dead ends: 1359 [2022-03-15 20:16:55,828 INFO L226 Difference]: Without dead ends: 1359 [2022-03-15 20:16:55,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:16:55,829 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 535 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:55,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 80 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:16:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-03-15 20:16:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 972. [2022-03-15 20:16:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 959 states have (on average 1.954118873826903) internal successors, (1874), 971 states have internal predecessors, (1874), 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-03-15 20:16:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1874 transitions. [2022-03-15 20:16:55,850 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1874 transitions. Word has length 14 [2022-03-15 20:16:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:55,850 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 1874 transitions. [2022-03-15 20:16:55,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-03-15 20:16:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1874 transitions. [2022-03-15 20:16:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:16:55,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:55,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:55,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:16:55,852 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -606220383, now seen corresponding path program 3 times [2022-03-15 20:16:55,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:55,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030758314] [2022-03-15 20:16:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:55,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:56,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:56,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030758314] [2022-03-15 20:16:56,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030758314] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:56,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:56,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:16:56,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65909014] [2022-03-15 20:16:56,015 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:56,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:56,019 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2022-03-15 20:16:56,019 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:56,028 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:56,029 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:56,040 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:56,041 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:56,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [23186#(and (not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 23188#(not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)), 23187#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 23189#(not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|))] [2022-03-15 20:16:56,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:16:56,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:16:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:16:56,283 INFO L87 Difference]: Start difference. First operand 972 states and 1874 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-03-15 20:16:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:57,503 INFO L93 Difference]: Finished difference Result 1346 states and 2532 transitions. [2022-03-15 20:16:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:16:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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 14 [2022-03-15 20:16:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:57,507 INFO L225 Difference]: With dead ends: 1346 [2022-03-15 20:16:57,507 INFO L226 Difference]: Without dead ends: 1346 [2022-03-15 20:16:57,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:16:57,509 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 507 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:57,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 75 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:16:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-03-15 20:16:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 955. [2022-03-15 20:16:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 942 states have (on average 1.9532908704883227) internal successors, (1840), 954 states have internal predecessors, (1840), 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-03-15 20:16:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1840 transitions. [2022-03-15 20:16:57,529 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1840 transitions. Word has length 14 [2022-03-15 20:16:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:57,529 INFO L470 AbstractCegarLoop]: Abstraction has 955 states and 1840 transitions. [2022-03-15 20:16:57,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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-03-15 20:16:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1840 transitions. [2022-03-15 20:16:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:16:57,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:57,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:57,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:16:57,530 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:57,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1440714427, now seen corresponding path program 4 times [2022-03-15 20:16:57,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:57,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135260484] [2022-03-15 20:16:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:57,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:57,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:57,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135260484] [2022-03-15 20:16:57,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135260484] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:57,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:57,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:16:57,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928558676] [2022-03-15 20:16:57,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:57,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:57,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2022-03-15 20:16:57,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:57,753 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:57,753 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:57,756 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:57,756 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:57,831 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:57,832 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:57,834 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:16:57,835 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:16:57,953 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [26494#(and (not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)), 26490#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 26491#(not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)), 26493#(not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|)), 26492#(and (not (= ~A~0.base |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))] [2022-03-15 20:16:57,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:16:57,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:57,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:16:57,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:16:57,954 INFO L87 Difference]: Start difference. First operand 955 states and 1840 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-03-15 20:16:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:59,237 INFO L93 Difference]: Finished difference Result 1249 states and 2343 transitions. [2022-03-15 20:16:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:16:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 14 [2022-03-15 20:16:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:59,241 INFO L225 Difference]: With dead ends: 1249 [2022-03-15 20:16:59,241 INFO L226 Difference]: Without dead ends: 1249 [2022-03-15 20:16:59,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:16:59,242 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 506 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:59,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 95 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:16:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-03-15 20:16:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 875. [2022-03-15 20:16:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 863 states have (on average 1.9524913093858633) internal successors, (1685), 874 states have internal predecessors, (1685), 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-03-15 20:16:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1685 transitions. [2022-03-15 20:16:59,258 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1685 transitions. Word has length 14 [2022-03-15 20:16:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:59,259 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 1685 transitions. [2022-03-15 20:16:59,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-03-15 20:16:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1685 transitions. [2022-03-15 20:16:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:16:59,259 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:59,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:59,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:16:59,260 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1684136118, now seen corresponding path program 1 times [2022-03-15 20:16:59,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:59,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92257051] [2022-03-15 20:16:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:59,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:59,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92257051] [2022-03-15 20:16:59,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92257051] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:59,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:59,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:16:59,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994915447] [2022-03-15 20:16:59,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:59,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:59,352 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:16:59,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:59,352 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:59,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:16:59,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:16:59,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:16:59,353 INFO L87 Difference]: Start difference. First operand 875 states and 1685 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-03-15 20:16:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:59,558 INFO L93 Difference]: Finished difference Result 940 states and 1810 transitions. [2022-03-15 20:16:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:16:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-03-15 20:16:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:59,562 INFO L225 Difference]: With dead ends: 940 [2022-03-15 20:16:59,562 INFO L226 Difference]: Without dead ends: 940 [2022-03-15 20:16:59,562 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-03-15 20:16:59,563 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:59,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:16:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-03-15 20:16:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 926. [2022-03-15 20:16:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 914 states have (on average 1.950765864332604) internal successors, (1783), 925 states have internal predecessors, (1783), 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-03-15 20:16:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1783 transitions. [2022-03-15 20:16:59,578 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1783 transitions. Word has length 15 [2022-03-15 20:16:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:16:59,579 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1783 transitions. [2022-03-15 20:16:59,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-03-15 20:16:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1783 transitions. [2022-03-15 20:16:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:16:59,579 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:16:59,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:16:59,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:16:59,580 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:16:59,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:16:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 619749854, now seen corresponding path program 1 times [2022-03-15 20:16:59,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:16:59,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375688312] [2022-03-15 20:16:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:16:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:16:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:16:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:16:59,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:16:59,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375688312] [2022-03-15 20:16:59,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375688312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:16:59,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:16:59,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:16:59,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001370440] [2022-03-15 20:16:59,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:16:59,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:16:59,687 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2022-03-15 20:16:59,687 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:16:59,687 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:16:59,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:16:59,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:16:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:16:59,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:16:59,688 INFO L87 Difference]: Start difference. First operand 926 states and 1783 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-03-15 20:16:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:16:59,980 INFO L93 Difference]: Finished difference Result 1199 states and 2278 transitions. [2022-03-15 20:16:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:16:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-03-15 20:16:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:16:59,983 INFO L225 Difference]: With dead ends: 1199 [2022-03-15 20:16:59,983 INFO L226 Difference]: Without dead ends: 1169 [2022-03-15 20:16:59,983 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-03-15 20:16:59,984 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:16:59,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 64 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:16:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-03-15 20:16:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1043. [2022-03-15 20:17:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1031 states have (on average 1.950533462657614) internal successors, (2011), 1042 states have internal predecessors, (2011), 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-03-15 20:17:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2011 transitions. [2022-03-15 20:17:00,003 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2011 transitions. Word has length 17 [2022-03-15 20:17:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:00,003 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 2011 transitions. [2022-03-15 20:17:00,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-03-15 20:17:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2011 transitions. [2022-03-15 20:17:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:00,004 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:00,004 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] [2022-03-15 20:17:00,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:17:00,005 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -966521304, now seen corresponding path program 1 times [2022-03-15 20:17:00,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:00,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210953568] [2022-03-15 20:17:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:00,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:00,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210953568] [2022-03-15 20:17:00,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210953568] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:00,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:00,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:00,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418034889] [2022-03-15 20:17:00,334 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:00,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:00,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:17:00,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:00,456 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:00,456 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:00,459 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:00,460 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:00,541 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:00,542 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:00,546 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:00,547 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:00,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [35632#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 35631#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 35633#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:00,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:17:00,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:17:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:17:00,596 INFO L87 Difference]: Start difference. First operand 1043 states and 2011 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-03-15 20:17:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:01,494 INFO L93 Difference]: Finished difference Result 1359 states and 2613 transitions. [2022-03-15 20:17:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:17:01,495 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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 20 [2022-03-15 20:17:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:01,500 INFO L225 Difference]: With dead ends: 1359 [2022-03-15 20:17:01,500 INFO L226 Difference]: Without dead ends: 1359 [2022-03-15 20:17:01,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:17:01,501 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 220 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:01,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 176 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-03-15 20:17:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1074. [2022-03-15 20:17:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1062 states have (on average 1.9519774011299436) internal successors, (2073), 1073 states have internal predecessors, (2073), 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-03-15 20:17:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2073 transitions. [2022-03-15 20:17:01,520 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2073 transitions. Word has length 20 [2022-03-15 20:17:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:01,520 INFO L470 AbstractCegarLoop]: Abstraction has 1074 states and 2073 transitions. [2022-03-15 20:17:01,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-03-15 20:17:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2073 transitions. [2022-03-15 20:17:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:01,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:01,521 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] [2022-03-15 20:17:01,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:17:01,521 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash -107052128, now seen corresponding path program 2 times [2022-03-15 20:17:01,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:01,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415481855] [2022-03-15 20:17:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:01,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:01,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415481855] [2022-03-15 20:17:01,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415481855] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:01,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:01,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:01,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086654456] [2022-03-15 20:17:01,797 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:01,799 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:01,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 50 transitions. [2022-03-15 20:17:01,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:01,894 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:01,895 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:01,901 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:01,901 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:01,951 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:01,952 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:01,956 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:01,956 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:02,083 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [39182#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 39183#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 39181#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:17:02,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:17:02,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:02,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:17:02,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:17:02,084 INFO L87 Difference]: Start difference. First operand 1074 states and 2073 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-03-15 20:17:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:03,117 INFO L93 Difference]: Finished difference Result 1382 states and 2657 transitions. [2022-03-15 20:17:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:17:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 20 [2022-03-15 20:17:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:03,121 INFO L225 Difference]: With dead ends: 1382 [2022-03-15 20:17:03,121 INFO L226 Difference]: Without dead ends: 1382 [2022-03-15 20:17:03,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:17:03,122 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 227 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:03,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 176 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-03-15 20:17:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1083. [2022-03-15 20:17:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1071 states have (on average 1.9523809523809523) internal successors, (2091), 1082 states have internal predecessors, (2091), 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-03-15 20:17:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2091 transitions. [2022-03-15 20:17:03,140 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2091 transitions. Word has length 20 [2022-03-15 20:17:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:03,140 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 2091 transitions. [2022-03-15 20:17:03,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-03-15 20:17:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2091 transitions. [2022-03-15 20:17:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:03,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:03,141 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] [2022-03-15 20:17:03,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:17:03,141 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1732162472, now seen corresponding path program 3 times [2022-03-15 20:17:03,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:03,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297878036] [2022-03-15 20:17:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:03,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:03,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297878036] [2022-03-15 20:17:03,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297878036] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:03,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:03,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:03,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28250115] [2022-03-15 20:17:03,369 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:03,371 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:03,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:17:03,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:03,552 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:03,553 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:03,556 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:03,557 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:03,570 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:03,571 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:03,573 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:03,574 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:03,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [42777#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 42778#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 42776#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:17:03,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:17:03,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:17:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:17:03,629 INFO L87 Difference]: Start difference. First operand 1083 states and 2091 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-03-15 20:17:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:04,838 INFO L93 Difference]: Finished difference Result 1410 states and 2711 transitions. [2022-03-15 20:17:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:17:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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 20 [2022-03-15 20:17:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:04,843 INFO L225 Difference]: With dead ends: 1410 [2022-03-15 20:17:04,843 INFO L226 Difference]: Without dead ends: 1410 [2022-03-15 20:17:04,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=960, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:17:04,844 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 300 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:04,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 163 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-03-15 20:17:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1092. [2022-03-15 20:17:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1080 states have (on average 1.9527777777777777) internal successors, (2109), 1091 states have internal predecessors, (2109), 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-03-15 20:17:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2109 transitions. [2022-03-15 20:17:04,864 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2109 transitions. Word has length 20 [2022-03-15 20:17:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:04,864 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 2109 transitions. [2022-03-15 20:17:04,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-03-15 20:17:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2109 transitions. [2022-03-15 20:17:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:04,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:04,865 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] [2022-03-15 20:17:04,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:17:04,865 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1543404683, now seen corresponding path program 1 times [2022-03-15 20:17:04,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:04,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047601561] [2022-03-15 20:17:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:04,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:04,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047601561] [2022-03-15 20:17:04,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047601561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:04,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:04,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:17:04,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467989474] [2022-03-15 20:17:04,988 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:04,990 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:04,997 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 72 transitions. [2022-03-15 20:17:04,997 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:05,115 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:05,115 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:05,118 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:05,118 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:05,130 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:05,132 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:05,135 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:05,135 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:05,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [46427#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))] [2022-03-15 20:17:05,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:17:05,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:17:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:17:05,184 INFO L87 Difference]: Start difference. First operand 1092 states and 2109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03-15 20:17:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:05,706 INFO L93 Difference]: Finished difference Result 1133 states and 2153 transitions. [2022-03-15 20:17:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:17:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 20 [2022-03-15 20:17:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:05,709 INFO L225 Difference]: With dead ends: 1133 [2022-03-15 20:17:05,709 INFO L226 Difference]: Without dead ends: 1133 [2022-03-15 20:17:05,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:17:05,710 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 327 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:05,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 65 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:17:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-03-15 20:17:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1062. [2022-03-15 20:17:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1050 states have (on average 1.9514285714285715) internal successors, (2049), 1061 states have internal predecessors, (2049), 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-03-15 20:17:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 2049 transitions. [2022-03-15 20:17:05,727 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 2049 transitions. Word has length 20 [2022-03-15 20:17:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:05,727 INFO L470 AbstractCegarLoop]: Abstraction has 1062 states and 2049 transitions. [2022-03-15 20:17:05,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03-15 20:17:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 2049 transitions. [2022-03-15 20:17:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:05,728 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:05,728 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] [2022-03-15 20:17:05,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 20:17:05,728 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 829986680, now seen corresponding path program 4 times [2022-03-15 20:17:05,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:05,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367434535] [2022-03-15 20:17:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:05,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:05,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367434535] [2022-03-15 20:17:05,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367434535] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:05,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:05,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:05,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805846382] [2022-03-15 20:17:05,992 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:05,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:05,998 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 20:17:05,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:06,036 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:06,037 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:06,039 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:06,040 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:06,061 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:06,062 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:06,066 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:06,066 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:06,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [49720#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 49719#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:17:06,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:06,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:06,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:06,158 INFO L87 Difference]: Start difference. First operand 1062 states and 2049 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-03-15 20:17:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:07,354 INFO L93 Difference]: Finished difference Result 1378 states and 2645 transitions. [2022-03-15 20:17:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:17:07,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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 20 [2022-03-15 20:17:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:07,358 INFO L225 Difference]: With dead ends: 1378 [2022-03-15 20:17:07,358 INFO L226 Difference]: Without dead ends: 1378 [2022-03-15 20:17:07,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1004, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 20:17:07,359 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 255 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:07,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 189 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2022-03-15 20:17:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1071. [2022-03-15 20:17:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1059 states have (on average 1.951841359773371) internal successors, (2067), 1070 states have internal predecessors, (2067), 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-03-15 20:17:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 2067 transitions. [2022-03-15 20:17:07,376 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 2067 transitions. Word has length 20 [2022-03-15 20:17:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:07,376 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 2067 transitions. [2022-03-15 20:17:07,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-03-15 20:17:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2067 transitions. [2022-03-15 20:17:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:07,377 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:07,377 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] [2022-03-15 20:17:07,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 20:17:07,378 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1125541963, now seen corresponding path program 1 times [2022-03-15 20:17:07,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:07,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280101339] [2022-03-15 20:17:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:07,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:07,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280101339] [2022-03-15 20:17:07,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280101339] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:07,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:07,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:07,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819217479] [2022-03-15 20:17:07,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:07,561 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:07,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 20:17:07,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:07,571 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:07,572 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:07,581 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:07,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:07,611 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:07,612 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:07,615 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:07,615 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:07,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [53301#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:07,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:07,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:07,660 INFO L87 Difference]: Start difference. First operand 1071 states and 2067 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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-03-15 20:17:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:08,923 INFO L93 Difference]: Finished difference Result 2034 states and 3843 transitions. [2022-03-15 20:17:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:17:08,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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 20 [2022-03-15 20:17:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:08,930 INFO L225 Difference]: With dead ends: 2034 [2022-03-15 20:17:08,931 INFO L226 Difference]: Without dead ends: 2034 [2022-03-15 20:17:08,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:17:08,931 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 516 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:08,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 227 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:17:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-03-15 20:17:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1175. [2022-03-15 20:17:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1163 states have (on average 1.9595872742906277) internal successors, (2279), 1174 states have internal predecessors, (2279), 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-03-15 20:17:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 2279 transitions. [2022-03-15 20:17:08,952 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 2279 transitions. Word has length 20 [2022-03-15 20:17:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:08,953 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 2279 transitions. [2022-03-15 20:17:08,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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-03-15 20:17:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2279 transitions. [2022-03-15 20:17:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:08,954 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:08,954 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] [2022-03-15 20:17:08,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 20:17:08,954 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -958468488, now seen corresponding path program 5 times [2022-03-15 20:17:08,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:08,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755708736] [2022-03-15 20:17:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:09,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:09,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755708736] [2022-03-15 20:17:09,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755708736] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:09,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:09,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:09,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176641746] [2022-03-15 20:17:09,132 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:09,134 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:09,138 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 34 transitions. [2022-03-15 20:17:09,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:09,152 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:09,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:09,157 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:09,157 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:09,167 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:09,168 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:09,173 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:09,174 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:09,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [57732#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:09,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:09,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:09,237 INFO L87 Difference]: Start difference. First operand 1175 states and 2279 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-03-15 20:17:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:10,413 INFO L93 Difference]: Finished difference Result 1758 states and 3352 transitions. [2022-03-15 20:17:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:17:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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 20 [2022-03-15 20:17:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:10,418 INFO L225 Difference]: With dead ends: 1758 [2022-03-15 20:17:10,418 INFO L226 Difference]: Without dead ends: 1758 [2022-03-15 20:17:10,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1072, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:17:10,419 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 347 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:10,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 226 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-03-15 20:17:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1139. [2022-03-15 20:17:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1127 states have (on average 1.9547471162377994) internal successors, (2203), 1138 states have internal predecessors, (2203), 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-03-15 20:17:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2203 transitions. [2022-03-15 20:17:10,439 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2203 transitions. Word has length 20 [2022-03-15 20:17:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:10,439 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 2203 transitions. [2022-03-15 20:17:10,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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-03-15 20:17:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2203 transitions. [2022-03-15 20:17:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:10,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:10,440 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] [2022-03-15 20:17:10,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 20:17:10,440 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1550981594, now seen corresponding path program 6 times [2022-03-15 20:17:10,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:10,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665596845] [2022-03-15 20:17:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:10,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:10,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665596845] [2022-03-15 20:17:10,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665596845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:10,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:10,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:10,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284607770] [2022-03-15 20:17:10,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:10,660 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:10,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 20:17:10,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:10,673 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:10,673 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:10,676 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:10,676 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:10,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [61834#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 61833#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:10,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:10,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:10,930 INFO L87 Difference]: Start difference. First operand 1139 states and 2203 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:12,112 INFO L93 Difference]: Finished difference Result 1989 states and 3856 transitions. [2022-03-15 20:17:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:17:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 20 [2022-03-15 20:17:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:12,117 INFO L225 Difference]: With dead ends: 1989 [2022-03-15 20:17:12,117 INFO L226 Difference]: Without dead ends: 1989 [2022-03-15 20:17:12,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:17:12,118 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 323 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:12,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 230 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2022-03-15 20:17:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1145. [2022-03-15 20:17:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1133 states have (on average 1.9549867608120035) internal successors, (2215), 1144 states have internal predecessors, (2215), 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-03-15 20:17:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2215 transitions. [2022-03-15 20:17:12,139 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2215 transitions. Word has length 20 [2022-03-15 20:17:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:12,139 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 2215 transitions. [2022-03-15 20:17:12,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2215 transitions. [2022-03-15 20:17:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:12,140 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:12,140 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] [2022-03-15 20:17:12,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 20:17:12,140 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:12,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -691512418, now seen corresponding path program 7 times [2022-03-15 20:17:12,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:12,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824227961] [2022-03-15 20:17:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:12,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:12,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824227961] [2022-03-15 20:17:12,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824227961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:12,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:12,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:12,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692460978] [2022-03-15 20:17:12,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:12,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:12,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 42 transitions. [2022-03-15 20:17:12,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:12,393 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:12,394 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:12,397 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:12,397 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:12,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [66155#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 66154#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:12,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:12,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:12,703 INFO L87 Difference]: Start difference. First operand 1145 states and 2215 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-03-15 20:17:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:13,819 INFO L93 Difference]: Finished difference Result 2012 states and 3900 transitions. [2022-03-15 20:17:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:17:13,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 20 [2022-03-15 20:17:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:13,823 INFO L225 Difference]: With dead ends: 2012 [2022-03-15 20:17:13,823 INFO L226 Difference]: Without dead ends: 2012 [2022-03-15 20:17:13,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:17:13,824 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 326 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:13,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 238 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:17:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-03-15 20:17:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1154. [2022-03-15 20:17:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1142 states have (on average 1.9553415061295971) internal successors, (2233), 1153 states have internal predecessors, (2233), 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-03-15 20:17:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2233 transitions. [2022-03-15 20:17:13,844 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2233 transitions. Word has length 20 [2022-03-15 20:17:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:13,844 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 2233 transitions. [2022-03-15 20:17:13,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-03-15 20:17:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2233 transitions. [2022-03-15 20:17:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:13,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:13,845 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] [2022-03-15 20:17:13,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:17:13,846 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1147702182, now seen corresponding path program 8 times [2022-03-15 20:17:13,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:13,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072525843] [2022-03-15 20:17:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:14,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:14,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072525843] [2022-03-15 20:17:14,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072525843] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:14,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:14,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:14,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [975991119] [2022-03-15 20:17:14,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:14,048 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:14,052 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 20:17:14,052 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:14,058 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:14,058 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:14,061 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:14,062 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:14,343 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [70521#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 70520#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:14,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:14,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:14,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:14,344 INFO L87 Difference]: Start difference. First operand 1154 states and 2233 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:15,641 INFO L93 Difference]: Finished difference Result 2040 states and 3954 transitions. [2022-03-15 20:17:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:17:15,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 20 [2022-03-15 20:17:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:15,644 INFO L225 Difference]: With dead ends: 2040 [2022-03-15 20:17:15,644 INFO L226 Difference]: Without dead ends: 2040 [2022-03-15 20:17:15,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:17:15,645 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 313 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:15,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 256 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2022-03-15 20:17:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1163. [2022-03-15 20:17:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1151 states have (on average 1.955690703735882) internal successors, (2251), 1162 states have internal predecessors, (2251), 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-03-15 20:17:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2251 transitions. [2022-03-15 20:17:15,665 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2251 transitions. Word has length 20 [2022-03-15 20:17:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:15,665 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 2251 transitions. [2022-03-15 20:17:15,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2251 transitions. [2022-03-15 20:17:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:15,666 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:15,666 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] [2022-03-15 20:17:15,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:17:15,666 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash -298941418, now seen corresponding path program 9 times [2022-03-15 20:17:15,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:15,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334790077] [2022-03-15 20:17:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:15,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:15,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334790077] [2022-03-15 20:17:15,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334790077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:15,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:15,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:15,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831738254] [2022-03-15 20:17:15,843 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:15,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:15,850 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 20:17:15,850 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:15,856 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:15,857 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:15,859 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:15,863 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:16,129 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [74936#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0)))), 74937#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:16,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:16,130 INFO L87 Difference]: Start difference. First operand 1163 states and 2251 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:17,638 INFO L93 Difference]: Finished difference Result 2120 states and 4108 transitions. [2022-03-15 20:17:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 20:17:17,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 20 [2022-03-15 20:17:17,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:17,642 INFO L225 Difference]: With dead ends: 2120 [2022-03-15 20:17:17,642 INFO L226 Difference]: Without dead ends: 2120 [2022-03-15 20:17:17,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=490, Invalid=1580, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 20:17:17,643 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 370 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:17,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 232 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-03-15 20:17:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1172. [2022-03-15 20:17:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1160 states have (on average 1.9560344827586207) internal successors, (2269), 1171 states have internal predecessors, (2269), 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-03-15 20:17:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 2269 transitions. [2022-03-15 20:17:17,664 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 2269 transitions. Word has length 20 [2022-03-15 20:17:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:17,664 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 2269 transitions. [2022-03-15 20:17:17,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-03-15 20:17:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 2269 transitions. [2022-03-15 20:17:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:17,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:17,665 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] [2022-03-15 20:17:17,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:17:17,665 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -414711117, now seen corresponding path program 2 times [2022-03-15 20:17:17,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:17,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984901174] [2022-03-15 20:17:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:17,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:17,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984901174] [2022-03-15 20:17:17,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984901174] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:17,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:17,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:17,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740998051] [2022-03-15 20:17:17,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:17,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:17,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:17:17,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:17,832 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:17,832 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:17,836 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:17,836 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:17,875 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:17,876 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:17,882 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:17,883 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:18,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [79480#(or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))), 79478#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)), 79479#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 79481#(or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0)))] [2022-03-15 20:17:18,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:17:18,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:18,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:17:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:17:18,041 INFO L87 Difference]: Start difference. First operand 1172 states and 2269 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:19,475 INFO L93 Difference]: Finished difference Result 2021 states and 3842 transitions. [2022-03-15 20:17:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:17:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:17:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:19,479 INFO L225 Difference]: With dead ends: 2021 [2022-03-15 20:17:19,479 INFO L226 Difference]: Without dead ends: 2013 [2022-03-15 20:17:19,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:17:19,480 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 510 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:19,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 289 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:17:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2022-03-15 20:17:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1357. [2022-03-15 20:17:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1345 states have (on average 1.9843866171003717) internal successors, (2669), 1356 states have internal predecessors, (2669), 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-03-15 20:17:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2669 transitions. [2022-03-15 20:17:19,503 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2669 transitions. Word has length 20 [2022-03-15 20:17:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:19,503 INFO L470 AbstractCegarLoop]: Abstraction has 1357 states and 2669 transitions. [2022-03-15 20:17:19,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2669 transitions. [2022-03-15 20:17:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:19,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:19,504 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] [2022-03-15 20:17:19,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:17:19,504 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash -247637642, now seen corresponding path program 10 times [2022-03-15 20:17:19,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:19,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342434259] [2022-03-15 20:17:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:19,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:19,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342434259] [2022-03-15 20:17:19,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342434259] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:19,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:19,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:19,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410857590] [2022-03-15 20:17:19,648 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:19,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:19,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 50 transitions. [2022-03-15 20:17:19,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:19,660 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:19,661 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:19,663 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:19,664 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:19,683 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:19,684 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:19,689 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:19,689 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:19,921 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [84262#(or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))), 84261#(or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))), 84260#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 84259#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_~p~0#1.base|))] [2022-03-15 20:17:19,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:17:19,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:17:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:17:19,922 INFO L87 Difference]: Start difference. First operand 1357 states and 2669 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-03-15 20:17:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:21,236 INFO L93 Difference]: Finished difference Result 1829 states and 3513 transitions. [2022-03-15 20:17:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:17:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 20 [2022-03-15 20:17:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:21,247 INFO L225 Difference]: With dead ends: 1829 [2022-03-15 20:17:21,247 INFO L226 Difference]: Without dead ends: 1829 [2022-03-15 20:17:21,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=982, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:17:21,248 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 453 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:21,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 244 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:17:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-03-15 20:17:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1279. [2022-03-15 20:17:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1269 states have (on average 1.9842395587076438) internal successors, (2518), 1278 states have internal predecessors, (2518), 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-03-15 20:17:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2518 transitions. [2022-03-15 20:17:21,269 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2518 transitions. Word has length 20 [2022-03-15 20:17:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:21,269 INFO L470 AbstractCegarLoop]: Abstraction has 1279 states and 2518 transitions. [2022-03-15 20:17:21,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-03-15 20:17:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2518 transitions. [2022-03-15 20:17:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:21,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:21,270 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] [2022-03-15 20:17:21,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:17:21,270 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -687121723, now seen corresponding path program 3 times [2022-03-15 20:17:21,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:21,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458662371] [2022-03-15 20:17:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:21,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:21,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458662371] [2022-03-15 20:17:21,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458662371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:21,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:21,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:21,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751859397] [2022-03-15 20:17:21,428 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:21,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:21,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:17:21,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:21,441 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:21,441 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:21,449 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:21,449 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:21,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [88704#(or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))), 88705#(or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))), 88702#(and (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 88703#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 88706#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|))] [2022-03-15 20:17:21,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:17:21,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:17:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:17:21,745 INFO L87 Difference]: Start difference. First operand 1279 states and 2518 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:24,272 INFO L93 Difference]: Finished difference Result 2547 states and 4808 transitions. [2022-03-15 20:17:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:17:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:17:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:24,278 INFO L225 Difference]: With dead ends: 2547 [2022-03-15 20:17:24,278 INFO L226 Difference]: Without dead ends: 2547 [2022-03-15 20:17:24,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1316, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:17:24,279 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 563 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:24,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 423 Invalid, 4744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:17:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2022-03-15 20:17:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 1283. [2022-03-15 20:17:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1273 states have (on average 1.9842890809112332) internal successors, (2526), 1282 states have internal predecessors, (2526), 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-03-15 20:17:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2526 transitions. [2022-03-15 20:17:24,303 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2526 transitions. Word has length 20 [2022-03-15 20:17:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:24,303 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 2526 transitions. [2022-03-15 20:17:24,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2526 transitions. [2022-03-15 20:17:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:17:24,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:24,304 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] [2022-03-15 20:17:24,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:17:24,304 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:24,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1472285291, now seen corresponding path program 4 times [2022-03-15 20:17:24,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:24,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542738258] [2022-03-15 20:17:24,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:24,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:24,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542738258] [2022-03-15 20:17:24,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542738258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:24,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:24,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:24,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26377135] [2022-03-15 20:17:24,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:24,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:24,470 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:17:24,470 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:24,711 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:24,711 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:24,714 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:24,715 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:24,800 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [93881#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)), 93882#(or (not (= |ULTIMATE.start_main_#t~mem44#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0))), 93884#(or (not (= |ULTIMATE.start_main_#t~mem44#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))), 93883#(or (not (= |ULTIMATE.start_main_#t~mem44#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0))), 93880#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|)), 93885#(or (not (= |ULTIMATE.start_main_#t~mem44#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))), 93888#(and (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_~p~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) (+ |ULTIMATE.start_main_~p~1#1.offset| 1)) 0)), 93887#(not (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) |t_funThread1of1ForFork0_~p~0#1.base|)), 93886#(not (= |ULTIMATE.start_main_#t~mem44#1.base| |t_funThread1of1ForFork0_~p~0#1.base|))] [2022-03-15 20:17:24,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:17:24,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:17:24,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:17:24,801 INFO L87 Difference]: Start difference. First operand 1283 states and 2526 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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-03-15 20:17:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:26,911 INFO L93 Difference]: Finished difference Result 2428 states and 4554 transitions. [2022-03-15 20:17:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 20:17:26,912 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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 20 [2022-03-15 20:17:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:26,917 INFO L225 Difference]: With dead ends: 2428 [2022-03-15 20:17:26,917 INFO L226 Difference]: Without dead ends: 2428 [2022-03-15 20:17:26,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=2036, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 20:17:26,919 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 773 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:26,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 334 Invalid, 3629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 20:17:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-03-15 20:17:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1145. [2022-03-15 20:17:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1136 states have (on average 1.9806338028169015) internal successors, (2250), 1144 states have internal predecessors, (2250), 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-03-15 20:17:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2250 transitions. [2022-03-15 20:17:26,943 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2250 transitions. Word has length 20 [2022-03-15 20:17:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:26,943 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 2250 transitions. [2022-03-15 20:17:26,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 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-03-15 20:17:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2250 transitions. [2022-03-15 20:17:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:26,944 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:26,945 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] [2022-03-15 20:17:26,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:17:26,945 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash -931102017, now seen corresponding path program 1 times [2022-03-15 20:17:26,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:26,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585007725] [2022-03-15 20:17:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:27,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:27,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585007725] [2022-03-15 20:17:27,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585007725] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:27,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:27,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:27,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205927338] [2022-03-15 20:17:27,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:27,203 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:27,210 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 54 transitions. [2022-03-15 20:17:27,210 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:27,272 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:27,273 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:27,276 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:27,276 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:27,306 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:27,306 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:27,311 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:27,312 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:27,362 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [98677#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:27,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:27,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:27,363 INFO L87 Difference]: Start difference. First operand 1145 states and 2250 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:28,101 INFO L93 Difference]: Finished difference Result 1357 states and 2642 transitions. [2022-03-15 20:17:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:17:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2022-03-15 20:17:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:28,103 INFO L225 Difference]: With dead ends: 1357 [2022-03-15 20:17:28,103 INFO L226 Difference]: Without dead ends: 1357 [2022-03-15 20:17:28,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:17:28,103 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:28,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 163 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:17:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-03-15 20:17:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1170. [2022-03-15 20:17:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1161 states have (on average 1.9810508182601205) internal successors, (2300), 1169 states have internal predecessors, (2300), 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-03-15 20:17:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 2300 transitions. [2022-03-15 20:17:28,119 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 2300 transitions. Word has length 26 [2022-03-15 20:17:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:28,119 INFO L470 AbstractCegarLoop]: Abstraction has 1170 states and 2300 transitions. [2022-03-15 20:17:28,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 2300 transitions. [2022-03-15 20:17:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:28,120 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:28,120 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] [2022-03-15 20:17:28,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:17:28,120 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:28,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash -326858321, now seen corresponding path program 2 times [2022-03-15 20:17:28,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:28,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793599964] [2022-03-15 20:17:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:28,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:28,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793599964] [2022-03-15 20:17:28,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793599964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:28,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:28,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:28,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063192289] [2022-03-15 20:17:28,342 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:28,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:28,352 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 54 transitions. [2022-03-15 20:17:28,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:28,387 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:28,387 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:28,390 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:28,391 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:28,414 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:28,414 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:28,416 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:28,417 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:28,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [102411#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:28,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:28,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:28,495 INFO L87 Difference]: Start difference. First operand 1170 states and 2300 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:29,426 INFO L93 Difference]: Finished difference Result 1375 states and 2676 transitions. [2022-03-15 20:17:29,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:17:29,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2022-03-15 20:17:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:29,428 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 20:17:29,428 INFO L226 Difference]: Without dead ends: 1375 [2022-03-15 20:17:29,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:17:29,428 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 243 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:29,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 158 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2022-03-15 20:17:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1175. [2022-03-15 20:17:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1166 states have (on average 1.9811320754716981) internal successors, (2310), 1174 states have internal predecessors, (2310), 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-03-15 20:17:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 2310 transitions. [2022-03-15 20:17:29,443 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 2310 transitions. Word has length 26 [2022-03-15 20:17:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:29,443 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 2310 transitions. [2022-03-15 20:17:29,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2310 transitions. [2022-03-15 20:17:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:29,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:29,444 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] [2022-03-15 20:17:29,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:17:29,444 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2112329791, now seen corresponding path program 3 times [2022-03-15 20:17:29,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:29,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695587947] [2022-03-15 20:17:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:29,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:29,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695587947] [2022-03-15 20:17:29,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695587947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:29,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:29,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:29,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134349096] [2022-03-15 20:17:29,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:29,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:29,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 54 transitions. [2022-03-15 20:17:29,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:29,688 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:29,688 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:29,693 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:29,693 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:29,701 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:29,701 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:29,704 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:29,707 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:29,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [106177#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:29,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:29,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:29,778 INFO L87 Difference]: Start difference. First operand 1175 states and 2310 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:30,685 INFO L93 Difference]: Finished difference Result 1393 states and 2710 transitions. [2022-03-15 20:17:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:17:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2022-03-15 20:17:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:30,687 INFO L225 Difference]: With dead ends: 1393 [2022-03-15 20:17:30,687 INFO L226 Difference]: Without dead ends: 1393 [2022-03-15 20:17:30,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:17:30,688 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 212 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:30,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 169 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-03-15 20:17:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1180. [2022-03-15 20:17:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1171 states have (on average 1.9812126387702818) internal successors, (2320), 1179 states have internal predecessors, (2320), 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-03-15 20:17:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2320 transitions. [2022-03-15 20:17:30,701 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2320 transitions. Word has length 26 [2022-03-15 20:17:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:30,701 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 2320 transitions. [2022-03-15 20:17:30,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-03-15 20:17:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2320 transitions. [2022-03-15 20:17:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:30,702 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:30,702 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] [2022-03-15 20:17:30,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:17:30,702 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2134436817, now seen corresponding path program 4 times [2022-03-15 20:17:30,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:30,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777275879] [2022-03-15 20:17:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:30,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:30,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:30,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777275879] [2022-03-15 20:17:30,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777275879] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:30,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:30,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:30,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940476837] [2022-03-15 20:17:30,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:30,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:30,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 54 transitions. [2022-03-15 20:17:30,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:30,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:30,985 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:30,988 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:30,988 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2022-03-15 20:17:31,036 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:31,036 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:31,038 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:31,039 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2022-03-15 20:17:31,127 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:17:31,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:17:31,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:17:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:17:31,127 INFO L87 Difference]: Start difference. First operand 1180 states and 2320 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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-03-15 20:17:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:32,144 INFO L93 Difference]: Finished difference Result 1304 states and 2497 transitions. [2022-03-15 20:17:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:17:32,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 26 [2022-03-15 20:17:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:32,146 INFO L225 Difference]: With dead ends: 1304 [2022-03-15 20:17:32,146 INFO L226 Difference]: Without dead ends: 1304 [2022-03-15 20:17:32,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=695, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:17:32,147 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 310 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:32,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 113 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-03-15 20:17:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1182. [2022-03-15 20:17:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1173 states have (on average 1.9812446717817562) internal successors, (2324), 1181 states have internal predecessors, (2324), 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-03-15 20:17:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 2324 transitions. [2022-03-15 20:17:32,159 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 2324 transitions. Word has length 26 [2022-03-15 20:17:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:32,160 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 2324 transitions. [2022-03-15 20:17:32,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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-03-15 20:17:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 2324 transitions. [2022-03-15 20:17:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:32,161 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:32,161 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] [2022-03-15 20:17:32,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 20:17:32,161 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:32,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2087069127, now seen corresponding path program 5 times [2022-03-15 20:17:32,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:32,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861541888] [2022-03-15 20:17:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:32,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:32,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861541888] [2022-03-15 20:17:32,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861541888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:32,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:32,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:32,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568244086] [2022-03-15 20:17:32,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:32,364 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:32,372 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 56 transitions. [2022-03-15 20:17:32,372 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:32,485 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:32,486 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:32,490 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:32,490 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:32,499 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:32,499 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:32,501 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:32,502 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:32,545 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [113695#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:32,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:32,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:32,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:32,545 INFO L87 Difference]: Start difference. First operand 1182 states and 2324 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-03-15 20:17:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:33,535 INFO L93 Difference]: Finished difference Result 1416 states and 2754 transitions. [2022-03-15 20:17:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:17:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 26 [2022-03-15 20:17:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:33,537 INFO L225 Difference]: With dead ends: 1416 [2022-03-15 20:17:33,537 INFO L226 Difference]: Without dead ends: 1416 [2022-03-15 20:17:33,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:17:33,538 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 215 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:33,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 170 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-03-15 20:17:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1187. [2022-03-15 20:17:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1178 states have (on average 1.9813242784380305) internal successors, (2334), 1186 states have internal predecessors, (2334), 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-03-15 20:17:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2334 transitions. [2022-03-15 20:17:33,550 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2334 transitions. Word has length 26 [2022-03-15 20:17:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:33,550 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2334 transitions. [2022-03-15 20:17:33,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-03-15 20:17:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2334 transitions. [2022-03-15 20:17:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:33,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:33,551 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] [2022-03-15 20:17:33,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 20:17:33,551 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:33,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1266433433, now seen corresponding path program 6 times [2022-03-15 20:17:33,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:33,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054817624] [2022-03-15 20:17:33,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:33,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:33,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054817624] [2022-03-15 20:17:33,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054817624] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:33,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:33,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:33,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813202462] [2022-03-15 20:17:33,731 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:33,734 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:33,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 60 transitions. [2022-03-15 20:17:33,744 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:33,801 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,801 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:33,806 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,806 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:33,849 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,849 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:33,874 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,874 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:33,896 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,896 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:17:33,901 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:33,902 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:33,981 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [117534#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:33,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:17:33,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:17:33,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:17:33,983 INFO L87 Difference]: Start difference. First operand 1187 states and 2334 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-03-15 20:17:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:35,313 INFO L93 Difference]: Finished difference Result 1730 states and 3335 transitions. [2022-03-15 20:17:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 20:17:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 26 [2022-03-15 20:17:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:35,316 INFO L225 Difference]: With dead ends: 1730 [2022-03-15 20:17:35,316 INFO L226 Difference]: Without dead ends: 1730 [2022-03-15 20:17:35,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1072, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 20:17:35,317 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 369 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:35,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 220 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:17:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-03-15 20:17:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1178. [2022-03-15 20:17:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1169 states have (on average 1.9811804961505561) internal successors, (2316), 1177 states have internal predecessors, (2316), 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-03-15 20:17:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2316 transitions. [2022-03-15 20:17:35,332 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2316 transitions. Word has length 26 [2022-03-15 20:17:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:35,332 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 2316 transitions. [2022-03-15 20:17:35,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-03-15 20:17:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2316 transitions. [2022-03-15 20:17:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:35,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:35,334 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] [2022-03-15 20:17:35,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 20:17:35,334 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 991683645, now seen corresponding path program 7 times [2022-03-15 20:17:35,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:35,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337942274] [2022-03-15 20:17:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:35,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:35,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337942274] [2022-03-15 20:17:35,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337942274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:35,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:35,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:35,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643149230] [2022-03-15 20:17:35,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:35,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:35,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 46 transitions. [2022-03-15 20:17:35,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:35,605 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:35,605 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:35,608 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:35,608 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:35,854 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [121686#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 121685#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:35,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:35,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:35,855 INFO L87 Difference]: Start difference. First operand 1178 states and 2316 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:36,980 INFO L93 Difference]: Finished difference Result 1823 states and 3532 transitions. [2022-03-15 20:17:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:17:36,980 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:17:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:36,982 INFO L225 Difference]: With dead ends: 1823 [2022-03-15 20:17:36,982 INFO L226 Difference]: Without dead ends: 1823 [2022-03-15 20:17:36,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:17:36,983 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 314 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:36,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 242 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:17:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2022-03-15 20:17:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1180. [2022-03-15 20:17:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1171 states have (on average 1.9812126387702818) internal successors, (2320), 1179 states have internal predecessors, (2320), 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-03-15 20:17:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2320 transitions. [2022-03-15 20:17:36,997 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2320 transitions. Word has length 26 [2022-03-15 20:17:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:36,997 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 2320 transitions. [2022-03-15 20:17:36,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2320 transitions. [2022-03-15 20:17:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:36,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:36,999 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] [2022-03-15 20:17:36,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 20:17:36,999 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1595927341, now seen corresponding path program 8 times [2022-03-15 20:17:37,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:37,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914907139] [2022-03-15 20:17:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:37,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:37,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914907139] [2022-03-15 20:17:37,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914907139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:37,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:37,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:37,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243327157] [2022-03-15 20:17:37,204 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:37,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:37,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 46 transitions. [2022-03-15 20:17:37,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:37,228 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:37,229 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:37,232 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:37,233 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:37,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [125920#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0)))), 125921#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)))] [2022-03-15 20:17:37,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:37,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:37,469 INFO L87 Difference]: Start difference. First operand 1180 states and 2320 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:38,787 INFO L93 Difference]: Finished difference Result 1841 states and 3566 transitions. [2022-03-15 20:17:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:17:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:17:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:38,790 INFO L225 Difference]: With dead ends: 1841 [2022-03-15 20:17:38,790 INFO L226 Difference]: Without dead ends: 1841 [2022-03-15 20:17:38,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=932, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:17:38,791 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 321 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:38,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 246 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2022-03-15 20:17:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1182. [2022-03-15 20:17:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1173 states have (on average 1.9812446717817562) internal successors, (2324), 1181 states have internal predecessors, (2324), 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-03-15 20:17:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 2324 transitions. [2022-03-15 20:17:38,805 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 2324 transitions. Word has length 26 [2022-03-15 20:17:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:38,805 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 2324 transitions. [2022-03-15 20:17:38,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 2324 transitions. [2022-03-15 20:17:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:38,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:38,806 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] [2022-03-15 20:17:38,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 20:17:38,806 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:38,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash -259851843, now seen corresponding path program 9 times [2022-03-15 20:17:38,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:38,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964432125] [2022-03-15 20:17:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:39,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:39,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964432125] [2022-03-15 20:17:39,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964432125] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:39,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:39,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:39,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1592743321] [2022-03-15 20:17:39,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:39,021 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:39,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 46 transitions. [2022-03-15 20:17:39,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:39,047 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:39,047 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:39,050 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:39,051 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:39,307 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [130182#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 130181#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:39,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:39,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:39,310 INFO L87 Difference]: Start difference. First operand 1182 states and 2324 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:40,739 INFO L93 Difference]: Finished difference Result 1859 states and 3600 transitions. [2022-03-15 20:17:40,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 20:17:40,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:17:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:40,743 INFO L225 Difference]: With dead ends: 1859 [2022-03-15 20:17:40,743 INFO L226 Difference]: Without dead ends: 1859 [2022-03-15 20:17:40,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 20:17:40,743 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 336 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:40,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 228 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-03-15 20:17:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1184. [2022-03-15 20:17:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1175 states have (on average 1.981276595744681) internal successors, (2328), 1183 states have internal predecessors, (2328), 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-03-15 20:17:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2328 transitions. [2022-03-15 20:17:40,757 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2328 transitions. Word has length 26 [2022-03-15 20:17:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:40,758 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2328 transitions. [2022-03-15 20:17:40,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2328 transitions. [2022-03-15 20:17:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:40,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:40,759 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] [2022-03-15 20:17:40,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 20:17:40,759 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -211651155, now seen corresponding path program 10 times [2022-03-15 20:17:40,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:40,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771445891] [2022-03-15 20:17:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:40,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:40,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771445891] [2022-03-15 20:17:40,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771445891] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:40,948 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:40,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:40,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98921136] [2022-03-15 20:17:40,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:40,951 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:40,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 46 transitions. [2022-03-15 20:17:40,958 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:40,970 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:40,971 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:40,973 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:40,974 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:41,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [134469#(and (or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))) (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))), 134468#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))))] [2022-03-15 20:17:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:41,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:41,216 INFO L87 Difference]: Start difference. First operand 1184 states and 2328 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:43,114 INFO L93 Difference]: Finished difference Result 1945 states and 3766 transitions. [2022-03-15 20:17:43,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 20:17:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:17:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:43,117 INFO L225 Difference]: With dead ends: 1945 [2022-03-15 20:17:43,117 INFO L226 Difference]: Without dead ends: 1945 [2022-03-15 20:17:43,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=584, Invalid=2278, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:17:43,118 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 365 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:43,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 217 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:17:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-03-15 20:17:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1186. [2022-03-15 20:17:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1177 states have (on average 1.9813084112149533) internal successors, (2332), 1185 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2332 transitions. [2022-03-15 20:17:43,131 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2332 transitions. Word has length 26 [2022-03-15 20:17:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:43,131 INFO L470 AbstractCegarLoop]: Abstraction has 1186 states and 2332 transitions. [2022-03-15 20:17:43,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2332 transitions. [2022-03-15 20:17:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:43,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:43,132 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] [2022-03-15 20:17:43,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 20:17:43,132 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:43,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 656352229, now seen corresponding path program 11 times [2022-03-15 20:17:43,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:43,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329707976] [2022-03-15 20:17:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:43,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:43,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:43,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329707976] [2022-03-15 20:17:43,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329707976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:43,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:43,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:43,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1110407763] [2022-03-15 20:17:43,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:43,311 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:43,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2022-03-15 20:17:43,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:43,340 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:43,340 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:43,345 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:43,346 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:43,441 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:43,441 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:43,457 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:43,458 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:43,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [138880#(not (= |ULTIMATE.start_main_#t~mem44#1.offset| 4)), 138879#(not (= |ULTIMATE.start_main_#t~mem44#1.offset| (+ |t_funThread1of1ForFork0_~p~0#1.offset| 4))), 138881#(<= |ULTIMATE.start_main_#t~mem44#1.offset| 0)] [2022-03-15 20:17:43,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:17:43,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:17:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:17:43,528 INFO L87 Difference]: Start difference. First operand 1186 states and 2332 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-03-15 20:17:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:44,522 INFO L93 Difference]: Finished difference Result 1889 states and 3635 transitions. [2022-03-15 20:17:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:17:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 26 [2022-03-15 20:17:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:44,524 INFO L225 Difference]: With dead ends: 1889 [2022-03-15 20:17:44,525 INFO L226 Difference]: Without dead ends: 1889 [2022-03-15 20:17:44,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:17:44,525 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 237 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:44,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-03-15 20:17:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1202. [2022-03-15 20:17:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1193 states have (on average 1.9815590947191952) internal successors, (2364), 1201 states have internal predecessors, (2364), 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-03-15 20:17:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 2364 transitions. [2022-03-15 20:17:44,542 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 2364 transitions. Word has length 26 [2022-03-15 20:17:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:44,542 INFO L470 AbstractCegarLoop]: Abstraction has 1202 states and 2364 transitions. [2022-03-15 20:17:44,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-03-15 20:17:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 2364 transitions. [2022-03-15 20:17:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:44,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:44,543 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] [2022-03-15 20:17:44,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 20:17:44,543 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:44,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 703719919, now seen corresponding path program 12 times [2022-03-15 20:17:44,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:44,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621663643] [2022-03-15 20:17:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:44,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:44,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621663643] [2022-03-15 20:17:44,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621663643] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:44,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:44,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:44,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847906126] [2022-03-15 20:17:44,717 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:44,721 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:44,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 54 transitions. [2022-03-15 20:17:44,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:44,734 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:44,735 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:44,737 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:44,738 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:44,894 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:44,895 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:44,915 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:17:44,916 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:17:44,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [143211#(or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))), 143212#(or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0)))] [2022-03-15 20:17:44,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:17:44,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:17:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:17:44,940 INFO L87 Difference]: Start difference. First operand 1202 states and 2364 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-03-15 20:17:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:46,043 INFO L93 Difference]: Finished difference Result 1702 states and 3272 transitions. [2022-03-15 20:17:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:17:46,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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 26 [2022-03-15 20:17:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:46,046 INFO L225 Difference]: With dead ends: 1702 [2022-03-15 20:17:46,046 INFO L226 Difference]: Without dead ends: 1702 [2022-03-15 20:17:46,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:17:46,047 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 215 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:46,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 375 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:17:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-03-15 20:17:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1200. [2022-03-15 20:17:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1191 states have (on average 1.9815281276238454) internal successors, (2360), 1199 states have internal predecessors, (2360), 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-03-15 20:17:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2360 transitions. [2022-03-15 20:17:46,064 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2360 transitions. Word has length 26 [2022-03-15 20:17:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:46,064 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 2360 transitions. [2022-03-15 20:17:46,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-03-15 20:17:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2360 transitions. [2022-03-15 20:17:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:46,065 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:46,065 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] [2022-03-15 20:17:46,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 20:17:46,066 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 912247065, now seen corresponding path program 13 times [2022-03-15 20:17:46,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:46,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964194682] [2022-03-15 20:17:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:46,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:46,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964194682] [2022-03-15 20:17:46,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964194682] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:46,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:46,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:46,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443238176] [2022-03-15 20:17:46,239 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:46,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:46,251 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2022-03-15 20:17:46,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:46,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [147347#(not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4) |ULTIMATE.start_main_#t~mem44#1.offset|)), 147343#(or (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4) |ULTIMATE.start_main_#t~mem44#1.offset|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0))), 147341#(<= |ULTIMATE.start_main_~p~1#1.offset| 0), 147342#(<= |ULTIMATE.start_main_#t~mem44#1.offset| 0), 147344#(or (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4) |ULTIMATE.start_main_#t~mem44#1.offset|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0))), 147346#(or (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4) |ULTIMATE.start_main_#t~mem44#1.offset|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))), 147345#(or (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4) |ULTIMATE.start_main_#t~mem44#1.offset|)) (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)))] [2022-03-15 20:17:46,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 20:17:46,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 20:17:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-03-15 20:17:46,612 INFO L87 Difference]: Start difference. First operand 1200 states and 2360 transitions. Second operand has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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-03-15 20:17:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:48,103 INFO L93 Difference]: Finished difference Result 2137 states and 4063 transitions. [2022-03-15 20:17:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 20:17:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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 26 [2022-03-15 20:17:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:48,106 INFO L225 Difference]: With dead ends: 2137 [2022-03-15 20:17:48,106 INFO L226 Difference]: Without dead ends: 2137 [2022-03-15 20:17:48,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=447, Invalid=1533, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:17:48,107 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 458 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:48,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 172 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:17:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-03-15 20:17:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1199. [2022-03-15 20:17:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1190 states have (on average 1.9815126050420169) internal successors, (2358), 1198 states have internal predecessors, (2358), 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-03-15 20:17:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2358 transitions. [2022-03-15 20:17:48,135 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2358 transitions. Word has length 26 [2022-03-15 20:17:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:48,135 INFO L470 AbstractCegarLoop]: Abstraction has 1199 states and 2358 transitions. [2022-03-15 20:17:48,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.611111111111111) internal successors, (47), 18 states have internal predecessors, (47), 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-03-15 20:17:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2358 transitions. [2022-03-15 20:17:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:17:48,136 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:48,136 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] [2022-03-15 20:17:48,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 20:17:48,137 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 959614755, now seen corresponding path program 14 times [2022-03-15 20:17:48,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:48,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510801106] [2022-03-15 20:17:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:48,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:48,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510801106] [2022-03-15 20:17:48,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510801106] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:48,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:48,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:17:48,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318621946] [2022-03-15 20:17:48,297 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:48,300 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:48,309 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2022-03-15 20:17:48,309 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:48,675 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [151950#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 7 ~A~0.offset)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|))), 151947#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 151953#(or (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|))), 151948#(or (= |ULTIMATE.start_main_#t~mem44#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem44#1.base|) 0))), 151952#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|))), 151949#(or (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))) 0))), 151954#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)), 151951#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem44#1.base|)))] [2022-03-15 20:17:48,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 20:17:48,676 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 20:17:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-03-15 20:17:48,676 INFO L87 Difference]: Start difference. First operand 1199 states and 2358 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:49,921 INFO L93 Difference]: Finished difference Result 1654 states and 3159 transitions. [2022-03-15 20:17:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:17:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:17:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:49,923 INFO L225 Difference]: With dead ends: 1654 [2022-03-15 20:17:49,923 INFO L226 Difference]: Without dead ends: 1654 [2022-03-15 20:17:49,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 20:17:49,924 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 540 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:49,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 236 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:17:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-03-15 20:17:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1110. [2022-03-15 20:17:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1102 states have (on average 1.9827586206896552) internal successors, (2185), 1109 states have internal predecessors, (2185), 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-03-15 20:17:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2185 transitions. [2022-03-15 20:17:49,940 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2185 transitions. Word has length 26 [2022-03-15 20:17:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:49,940 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 2185 transitions. [2022-03-15 20:17:49,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:17:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2185 transitions. [2022-03-15 20:17:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:17:49,941 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:49,941 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] [2022-03-15 20:17:49,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 20:17:49,941 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:49,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1387606777, now seen corresponding path program 1 times [2022-03-15 20:17:49,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:49,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866890341] [2022-03-15 20:17:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:17:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:17:50,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:17:50,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866890341] [2022-03-15 20:17:50,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866890341] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:17:50,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:17:50,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:17:50,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [889165833] [2022-03-15 20:17:50,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:17:50,032 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:17:50,038 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 31 transitions. [2022-03-15 20:17:50,038 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:17:50,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:17:50,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:17:50,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:17:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:17:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:17:50,040 INFO L87 Difference]: Start difference. First operand 1110 states and 2185 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-03-15 20:17:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:17:50,392 INFO L93 Difference]: Finished difference Result 1211 states and 2382 transitions. [2022-03-15 20:17:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:17:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 31 [2022-03-15 20:17:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:17:50,393 INFO L225 Difference]: With dead ends: 1211 [2022-03-15 20:17:50,393 INFO L226 Difference]: Without dead ends: 1211 [2022-03-15 20:17:50,394 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-03-15 20:17:50,394 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:17:50,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 55 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:17:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2022-03-15 20:17:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1172. [2022-03-15 20:17:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1164 states have (on average 1.9810996563573884) internal successors, (2306), 1171 states have internal predecessors, (2306), 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-03-15 20:17:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 2306 transitions. [2022-03-15 20:17:50,409 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 2306 transitions. Word has length 31 [2022-03-15 20:17:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:17:50,409 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 2306 transitions. [2022-03-15 20:17:50,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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-03-15 20:17:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 2306 transitions. [2022-03-15 20:17:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:17:50,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:17:50,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:50,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 20:17:50,411 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-03-15 20:17:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:17:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 843426379, now seen corresponding path program 1 times [2022-03-15 20:17:50,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:17:50,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260004799] [2022-03-15 20:17:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:17:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:17:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:17:50,454 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:17:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:17:50,524 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:17:50,524 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:17:50,525 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (25 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2022-03-15 20:17:50,527 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (14 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2022-03-15 20:17:50,528 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2022-03-15 20:17:50,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2022-03-15 20:17:50,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 20:17:50,531 INFO L732 BasicCegarLoop]: Path program histogram: [14, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:17:50,536 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:17:50,536 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:17:50,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:17:50 BasicIcfg [2022-03-15 20:17:50,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:17:50,618 INFO L158 Benchmark]: Toolchain (without parser) took 248900.79ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 131.3MB in the beginning and 239.3MB in the end (delta: -107.9MB). Peak memory consumption was 166.0MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.11ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 131.2MB in the beginning and 235.1MB in the end (delta: -103.9MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.42ms. Allocated memory is still 293.6MB. Free memory was 235.1MB in the beginning and 231.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: Boogie Preprocessor took 32.88ms. Allocated memory is still 293.6MB. Free memory was 231.6MB in the beginning and 229.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: RCFGBuilder took 575.70ms. Allocated memory is still 293.6MB. Free memory was 229.0MB in the beginning and 205.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,618 INFO L158 Benchmark]: TraceAbstraction took 247589.03ms. Allocated memory is still 293.6MB. Free memory was 205.4MB in the beginning and 239.3MB in the end (delta: -33.9MB). Peak memory consumption was 137.6MB. Max. memory is 8.0GB. [2022-03-15 20:17:50,619 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.11ms. Allocated memory is still 190.8MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 631.11ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 131.2MB in the beginning and 235.1MB in the end (delta: -103.9MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.42ms. Allocated memory is still 293.6MB. Free memory was 235.1MB in the beginning and 231.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.88ms. Allocated memory is still 293.6MB. Free memory was 231.6MB in the beginning and 229.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.70ms. Allocated memory is still 293.6MB. Free memory was 229.0MB in the beginning and 205.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 247589.03ms. Allocated memory is still 293.6MB. Free memory was 205.4MB in the beginning and 239.3MB in the end (delta: -33.9MB). Peak memory consumption was 137.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 185.8s, 211 PlacesBefore, 78 PlacesAfterwards, 207 TransitionsBefore, 74 TransitionsAfterwards, 4288 CoEnabledTransitionPairs, 9 FixpointIterations, 137 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 173 TotalNumberOfCompositions, 35398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6389, positive: 5218, positive conditional: 0, positive unconditional: 5218, negative: 1171, negative conditional: 0, negative unconditional: 1171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1789, positive: 1697, positive conditional: 0, positive unconditional: 1697, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6389, positive: 3521, positive conditional: 0, positive unconditional: 3521, negative: 1079, negative conditional: 0, negative unconditional: 1079, unknown: 1789, unknown conditional: 0, unknown unconditional: 1789] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 262, Positive conditional cache size: 0, Positive unconditional cache size: 262, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1253]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1245] 0 pthread_t t1; [L1246] 0 struct s *p = malloc(sizeof(struct s)); [L1247] CALL 0 init(p,9) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(p,9) [L1248] 0 A = malloc(sizeof(struct s)) [L1249] 0 init(A,3) [L1249] CALL 0 init(A,3) [L1228] 0 p -> datum = x [L1229] 0 p -> next = ((void *)0) [L1249] RET 0 init(A,3) [L1250] EXPR 0 A->next [L1250] 0 A->next = p [L1251] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={2:0}, B_mutex={3:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1234] 1 struct s *p = malloc(sizeof(struct s)); [L1235] 1 struct s *t; [L1236] CALL 1 init(p,7) [L1228] 1 p -> datum = x VAL [\old(x)=3, \old(x)=7, A={11:0}, A_mutex={2:0}, B_mutex={3:0}, p={-3:0}, p={11:0}, p={11:0}, p={-3:0}, p -> datum = x=102, x=7, x=3] [L1253] EXPR 0 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1253] 0 p = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] [L1228] 1 p -> datum = x VAL [\old(x)=3, \old(x)=7, A={11:0}, A_mutex={2:0}, B_mutex={3:0}, p={11:0}, p={-3:0}, p={11:0}, p={-3:0}, x=3, x=7] [L1229] 1 p -> next = ((void *)0) [L1236] RET 1 init(p,7) [L1238] EXPR 1 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B_mutex={3:0}, p={-3:0}] [L1238] 1 t = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B_mutex={3:0}, p={-3:0}, t={-2:0}] [L1239] EXPR 1 A->next VAL [A={11:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B_mutex={3:0}, p={-3:0}, t={-2:0}] [L1239] 1 A->next = p VAL [A={11:0}, A->next = p=121, A_mutex={2:0}, arg={0:0}, arg={0:0}, B_mutex={3:0}, p={-3:0}, t={-2:0}] [L1253] 0 p = A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={2:0}, B_mutex={3:0}, p={-2:0}, t1={13:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p -> datum = x [1228] * C: A->next = p [1250] * C: A->next = p [1239] * C: A->next = p [1250] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: A = malloc(sizeof(struct s)) [1248] * C: A->next = p [1250] * C: A->next = p [1250] * C: p -> datum = x [1228] * C: p -> datum = x [1228] and C: p = A->next [1253] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 277 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 247.3s, OverallIterations: 42, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 185.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12771 SdHoareTripleChecker+Valid, 33.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12771 mSDsluCounter, 7291 SdHoareTripleChecker+Invalid, 28.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12916 mSDsCounter, 4757 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54594 IncrementalHoareTripleChecker+Invalid, 59351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4757 mSolverCounterUnsat, 1629 mSDtfsCounter, 54594 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1434 GetRequests, 327 SyntacticMatches, 15 SemanticMatches, 1092 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8139 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1357occurred in iteration=23, InterpolantAutomatonStates: 905, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 41 MinimizatonAttempts, 19202 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 11482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-03-15 20:17:50,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...