/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_05-ptra_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:13:45,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:13:45,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:13:45,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:13:45,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:13:45,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:13:45,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:13:45,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:13:45,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:13:45,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:13:45,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:13:45,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:13:45,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:13:45,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:13:45,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:13:45,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:13:45,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:13:45,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:13:45,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:13:45,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:13:45,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:13:45,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:13:45,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:13:45,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:13:45,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:13:45,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:13:45,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:13:45,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:13:45,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:13:45,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:13:45,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:13:45,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:13:45,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:13:45,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:13:45,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:13:45,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:13:45,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:13:45,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:13:45,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:13:45,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:13:45,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:13:45,771 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:45,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:13:45,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:13:45,786 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:13:45,786 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:13:45,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:13:45,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:13:45,787 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:13:45,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:13:45,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:13:45,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:13:45,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:13:45,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:13:45,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:45,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:13:45,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:13:45,789 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:45,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:13:46,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:13:46,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:13:46,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:13:46,016 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:13:46,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2022-03-15 20:13:46,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ead309d/57b73334499240d2b95b96930b90c354/FLAGc19754991 [2022-03-15 20:13:46,521 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:13:46,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_05-ptra_rc.i [2022-03-15 20:13:46,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ead309d/57b73334499240d2b95b96930b90c354/FLAGc19754991 [2022-03-15 20:13:46,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ead309d/57b73334499240d2b95b96930b90c354 [2022-03-15 20:13:46,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:13:46,556 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:13:46,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:46,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:13:46,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:13:46,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:46" (1/1) ... [2022-03-15 20:13:46,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8e34ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:46, skipping insertion in model container [2022-03-15 20:13:46,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:13:46" (1/1) ... [2022-03-15 20:13:46,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:13:46,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:13:47,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:47,008 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:13:47,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:13:47,083 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:13:47,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:47 WrapperNode [2022-03-15 20:13:47,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:13:47,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:47,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:13:47,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:13:47,091 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:47" (1/1) ... [2022-03-15 20:13:47,118 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:47" (1/1) ... [2022-03-15 20:13:47,151 INFO L137 Inliner]: procedures = 369, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 212 [2022-03-15 20:13:47,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:13:47,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:13:47,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:13:47,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:13:47,159 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:47" (1/1) ... [2022-03-15 20:13:47,159 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:47" (1/1) ... [2022-03-15 20:13:47,165 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:47" (1/1) ... [2022-03-15 20:13:47,166 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:47" (1/1) ... [2022-03-15 20:13:47,176 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:47" (1/1) ... [2022-03-15 20:13:47,177 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:47" (1/1) ... [2022-03-15 20:13:47,178 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:47" (1/1) ... [2022-03-15 20:13:47,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:13:47,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:13:47,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:13:47,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:13:47,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:47" (1/1) ... [2022-03-15 20:13:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:13:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:13:47,222 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:47,224 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:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-15 20:13:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:13:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:13:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:13:47,257 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:47,392 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:13:47,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:13:47,728 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:13:47,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:13:47,739 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:13:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:47 BoogieIcfgContainer [2022-03-15 20:13:47,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:13:47,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:13:47,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:13:47,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:13:47,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:13:46" (1/3) ... [2022-03-15 20:13:47,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2133c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:47, skipping insertion in model container [2022-03-15 20:13:47,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:13:47" (2/3) ... [2022-03-15 20:13:47,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2133c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:13:47, skipping insertion in model container [2022-03-15 20:13:47,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:13:47" (3/3) ... [2022-03-15 20:13:47,747 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2022-03-15 20:13:47,751 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:13:47,751 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:13:47,752 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-03-15 20:13:47,752 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:13:47,803 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:47,803 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:47,803 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:47,804 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:47,804 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:47,804 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:47,804 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:47,804 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:47,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,805 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:47,805 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:47,805 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:47,805 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:47,805 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 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:47,808 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:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,808 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:47,809 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:47,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,810 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:47,810 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:47,810 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:47,810 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:47,810 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:47,810 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:47,810 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,811 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:47,812 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:47,812 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:47,812 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:47,812 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:47,812 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:47,812 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:47,813 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:47,813 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:47,813 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:47,813 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:47,813 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:47,813 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:47,813 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:47,813 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:47,813 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:47,814 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:47,814 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:47,814 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:47,814 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:47,814 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:47,814 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:47,814 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:47,814 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:47,815 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:47,815 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:47,815 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:47,815 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:47,816 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:47,816 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:47,818 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:47,818 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:47,818 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:47,822 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:47,822 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:47,823 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:47,823 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:47,823 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:47,823 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:47,823 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:47,823 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:47,823 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,824 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,825 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,826 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:47,827 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:47,827 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:47,827 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:47,827 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:47,827 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:47,827 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:47,827 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:47,827 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:47,827 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,828 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:47,829 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:47,829 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:47,829 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:47,829 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:47,829 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:47,829 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:47,829 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:47,829 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:47,829 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:47,830 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:47,830 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:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,830 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,831 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,831 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,831 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:47,831 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:47,831 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,831 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,831 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:47,831 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:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,832 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:47,832 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:47,832 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:47,833 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:47,833 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:47,833 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:47,833 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:47,833 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:47,833 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:47,833 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:47,833 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:47,833 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:47,834 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:47,834 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:47,834 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:47,834 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:47,834 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:47,834 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,834 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:47,834 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,834 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:47,834 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,835 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:47,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,835 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,836 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,838 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,839 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,840 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,841 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,842 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,843 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:47,843 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:47,843 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:47,843 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:47,845 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:47,845 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,845 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:47,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,846 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:47,846 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:47,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~sp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,846 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:47,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,846 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:47,846 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:47,846 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:47,846 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,846 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:47,847 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:47,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,847 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:47,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,847 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:47,847 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:47,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,847 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~malloc33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,847 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:47,847 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:47,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem35#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,848 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:47,848 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~ip~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:13:47,848 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:47,849 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 20:13:47,879 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:13:47,886 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:47,886 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-03-15 20:13:47,897 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:13:47,905 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 250 transitions, 505 flow [2022-03-15 20:13:47,907 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 250 transitions, 505 flow [2022-03-15 20:13:47,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 254 places, 250 transitions, 505 flow [2022-03-15 20:13:48,021 INFO L129 PetriNetUnfolder]: 0/249 cut-off events. [2022-03-15 20:13:48,021 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 20:13:48,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 249 events. 0/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-03-15 20:13:48,026 INFO L116 LiptonReduction]: Number of co-enabled transitions 4760 [2022-03-15 20:14:33,990 WARN L228 SmtUtils]: Spent 24.09s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:00,579 WARN L228 SmtUtils]: Spent 26.59s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:22,687 WARN L228 SmtUtils]: Spent 22.11s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:44,591 WARN L228 SmtUtils]: Spent 21.90s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:15:51,365 WARN L228 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 237 DAG size of output: 235 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:16:06,294 WARN L228 SmtUtils]: Spent 14.01s on a formula simplification. DAG size of input: 237 DAG size of output: 235 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:17:58,085 WARN L228 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 363 DAG size of output: 359 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:18:56,440 WARN L228 SmtUtils]: Spent 58.35s on a formula simplification that was a NOOP. DAG size: 316 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:21:22,171 WARN L228 SmtUtils]: Spent 2.43m on a formula simplification. DAG size of input: 363 DAG size of output: 359 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:06,862 WARN L228 SmtUtils]: Spent 44.69s on a formula simplification that was a NOOP. DAG size: 316 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:26,740 WARN L228 SmtUtils]: Spent 19.84s on a formula simplification. DAG size of input: 323 DAG size of output: 321 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:22:36,869 WARN L228 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 321 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:24:40,370 WARN L228 SmtUtils]: Spent 2.06m on a formula simplification. DAG size of input: 323 DAG size of output: 321 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:25:39,342 WARN L228 SmtUtils]: Spent 58.97s on a formula simplification that was a NOOP. DAG size: 321 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:25:39,348 INFO L131 LiptonReduction]: Checked pairs total: 39660 [2022-03-15 20:25:39,349 INFO L133 LiptonReduction]: Total number of compositions: 244 [2022-03-15 20:25:39,370 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 78 transitions, 161 flow [2022-03-15 20:25:39,436 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 932 states, 889 states have (on average 2.0078740157480315) internal successors, (1785), 931 states have internal predecessors, (1785), 0 states have call successors, (0), 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:25:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 932 states, 889 states have (on average 2.0078740157480315) internal successors, (1785), 931 states have internal predecessors, (1785), 0 states have call successors, (0), 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:25:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:25:39,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:39,444 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:25:39,445 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 835, now seen corresponding path program 1 times [2022-03-15 20:25:39,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:39,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210383616] [2022-03-15 20:25:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:39,538 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:25:39,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:39,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210383616] [2022-03-15 20:25:39,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210383616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:39,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:39,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:25:39,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234803892] [2022-03-15 20:25:39,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:39,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:39,545 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:25:39,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:39,547 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:39,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:25:39,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:25:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:25:39,565 INFO L87 Difference]: Start difference. First operand has 932 states, 889 states have (on average 2.0078740157480315) internal successors, (1785), 931 states have internal predecessors, (1785), 0 states have call successors, (0), 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:25:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:39,689 INFO L93 Difference]: Finished difference Result 920 states and 1773 transitions. [2022-03-15 20:25:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:25:39,693 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:25:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:39,703 INFO L225 Difference]: With dead ends: 920 [2022-03-15 20:25:39,704 INFO L226 Difference]: Without dead ends: 920 [2022-03-15 20:25:39,704 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:25:39,706 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:25:39,707 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:25:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-03-15 20:25:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2022-03-15 20:25:39,779 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:25:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1773 transitions. [2022-03-15 20:25:39,784 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1773 transitions. Word has length 1 [2022-03-15 20:25:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:39,785 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1773 transitions. [2022-03-15 20:25:39,785 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:25:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1773 transitions. [2022-03-15 20:25:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 20:25:39,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:39,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 20:25:39,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:25:39,786 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 801933895, now seen corresponding path program 1 times [2022-03-15 20:25:39,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:39,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477718573] [2022-03-15 20:25:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:39,945 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:25:39,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:39,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477718573] [2022-03-15 20:25:39,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477718573] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:39,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:39,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:25:39,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891566006] [2022-03-15 20:25:39,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:39,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:39,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 20:25:39,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:39,947 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:39,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:25:39,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:39,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:25:39,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:25:39,948 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:25:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:40,014 INFO L93 Difference]: Finished difference Result 836 states and 1608 transitions. [2022-03-15 20:25:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:25:40,015 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:25:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:40,017 INFO L225 Difference]: With dead ends: 836 [2022-03-15 20:25:40,018 INFO L226 Difference]: Without dead ends: 836 [2022-03-15 20:25:40,018 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:25:40,019 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:25:40,019 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:25:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-03-15 20:25:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2022-03-15 20:25:40,036 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:25:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1608 transitions. [2022-03-15 20:25:40,039 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1608 transitions. Word has length 5 [2022-03-15 20:25:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:40,039 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1608 transitions. [2022-03-15 20:25:40,039 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:25:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1608 transitions. [2022-03-15 20:25:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:25:40,039 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:40,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:40,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:25:40,040 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1306984267, now seen corresponding path program 1 times [2022-03-15 20:25:40,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:40,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991147641] [2022-03-15 20:25:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:40,258 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:25:40,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:40,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991147641] [2022-03-15 20:25:40,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991147641] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:40,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:40,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:40,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736280564] [2022-03-15 20:25:40,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:40,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:40,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 20:25:40,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:40,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:40,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:40,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:40,277 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:25:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:40,861 INFO L93 Difference]: Finished difference Result 906 states and 1743 transitions. [2022-03-15 20:25:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:40,861 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:25:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:40,864 INFO L225 Difference]: With dead ends: 906 [2022-03-15 20:25:40,864 INFO L226 Difference]: Without dead ends: 906 [2022-03-15 20:25:40,865 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:25:40,866 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 45 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:40,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 86 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:25:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-03-15 20:25:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 891. [2022-03-15 20:25:40,879 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:25:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1714 transitions. [2022-03-15 20:25:40,881 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1714 transitions. Word has length 9 [2022-03-15 20:25:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:40,881 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 1714 transitions. [2022-03-15 20:25:40,881 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:25:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1714 transitions. [2022-03-15 20:25:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:25:40,882 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:40,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:40,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:25:40,882 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash 414202200, now seen corresponding path program 1 times [2022-03-15 20:25:40,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:40,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167474849] [2022-03-15 20:25:40,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:40,983 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:25:40,983 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:40,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167474849] [2022-03-15 20:25:40,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167474849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:40,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:40,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:40,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400719851] [2022-03-15 20:25:40,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:40,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:40,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:25:40,986 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:40,986 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:40,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:40,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:40,987 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:25:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:41,614 INFO L93 Difference]: Finished difference Result 1450 states and 2770 transitions. [2022-03-15 20:25:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:41,614 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:25:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:41,620 INFO L225 Difference]: With dead ends: 1450 [2022-03-15 20:25:41,620 INFO L226 Difference]: Without dead ends: 1450 [2022-03-15 20:25:41,620 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:25:41,621 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 104 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:41,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 45 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:25:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-03-15 20:25:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1002. [2022-03-15 20:25:41,639 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:25:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1934 transitions. [2022-03-15 20:25:41,642 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1934 transitions. Word has length 11 [2022-03-15 20:25:41,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:41,642 INFO L470 AbstractCegarLoop]: Abstraction has 1002 states and 1934 transitions. [2022-03-15 20:25:41,642 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:25:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1934 transitions. [2022-03-15 20:25:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:25:41,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:41,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:41,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:25:41,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 346554563, now seen corresponding path program 1 times [2022-03-15 20:25:41,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:41,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853756239] [2022-03-15 20:25:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:41,911 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:25:41,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:41,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853756239] [2022-03-15 20:25:41,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853756239] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:41,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:41,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:41,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677081423] [2022-03-15 20:25:41,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:41,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:41,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 20:25:41,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:41,952 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:41,954 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:41,958 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:41,959 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:41,988 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:41,989 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:41,992 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:41,993 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:42,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13558#(< |t_funThread1of1ForFork0_init_#in~p#1.offset| (+ ~A~0.offset 1))] [2022-03-15 20:25:42,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:25:42,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:25:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:25:42,449 INFO L87 Difference]: Start difference. First operand 1002 states and 1934 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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:25:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:43,052 INFO L93 Difference]: Finished difference Result 999 states and 1927 transitions. [2022-03-15 20:25:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:25:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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 14 [2022-03-15 20:25:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:43,056 INFO L225 Difference]: With dead ends: 999 [2022-03-15 20:25:43,057 INFO L226 Difference]: Without dead ends: 999 [2022-03-15 20:25:43,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:25:43,057 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 170 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:43,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 93 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:25:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-03-15 20:25:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 964. [2022-03-15 20:25:43,089 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:25:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1858 transitions. [2022-03-15 20:25:43,091 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1858 transitions. Word has length 14 [2022-03-15 20:25:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:43,094 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1858 transitions. [2022-03-15 20:25:43,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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:25:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1858 transitions. [2022-03-15 20:25:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:25:43,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:43,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:43,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:25:43,099 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -134029405, now seen corresponding path program 1 times [2022-03-15 20:25:43,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:43,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598422625] [2022-03-15 20:25:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:43,225 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:25:43,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:43,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598422625] [2022-03-15 20:25:43,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598422625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:43,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:43,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:43,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501420169] [2022-03-15 20:25:43,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:43,227 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:43,229 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2022-03-15 20:25:43,229 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:43,234 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:43,235 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:43,238 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:43,238 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:43,263 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:43,264 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:43,267 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:43,268 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:43,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16506#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))] [2022-03-15 20:25:43,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:25:43,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:25:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:25:43,306 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:25:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:44,516 INFO L93 Difference]: Finished difference Result 1230 states and 2316 transitions. [2022-03-15 20:25:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:25:44,516 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:25:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:44,520 INFO L225 Difference]: With dead ends: 1230 [2022-03-15 20:25:44,520 INFO L226 Difference]: Without dead ends: 1230 [2022-03-15 20:25:44,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:25:44,521 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 406 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:44,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 71 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:25:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-03-15 20:25:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 875. [2022-03-15 20:25:44,536 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:25:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1685 transitions. [2022-03-15 20:25:44,538 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1685 transitions. Word has length 14 [2022-03-15 20:25:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:44,539 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 1685 transitions. [2022-03-15 20:25:44,539 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:25:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1685 transitions. [2022-03-15 20:25:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:25:44,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:44,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:25:44,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:25:44,541 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -59659492, now seen corresponding path program 1 times [2022-03-15 20:25:44,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:44,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724308724] [2022-03-15 20:25:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:44,639 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:25:44,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:44,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724308724] [2022-03-15 20:25:44,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724308724] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:44,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:44,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:44,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700276529] [2022-03-15 20:25:44,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:44,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:44,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:25:44,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:44,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:44,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:44,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:44,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:44,645 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:25:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:44,971 INFO L93 Difference]: Finished difference Result 926 states and 1783 transitions. [2022-03-15 20:25:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:44,979 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:25:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:44,982 INFO L225 Difference]: With dead ends: 926 [2022-03-15 20:25:44,982 INFO L226 Difference]: Without dead ends: 926 [2022-03-15 20:25:44,982 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:25:44,983 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:44,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 67 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:25:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-03-15 20:25:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2022-03-15 20:25:44,996 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:25:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1783 transitions. [2022-03-15 20:25:44,998 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1783 transitions. Word has length 15 [2022-03-15 20:25:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:44,998 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1783 transitions. [2022-03-15 20:25:44,998 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:25:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1783 transitions. [2022-03-15 20:25:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:25:44,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:44,999 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:25:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:25:44,999 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -835243253, now seen corresponding path program 1 times [2022-03-15 20:25:45,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:45,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392556524] [2022-03-15 20:25:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 20:25:45,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:45,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392556524] [2022-03-15 20:25:45,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392556524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:45,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:45,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:25:45,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727976155] [2022-03-15 20:25:45,099 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:45,100 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:45,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2022-03-15 20:25:45,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:45,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:45,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:25:45,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:45,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:25:45,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:25:45,103 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:25:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:45,588 INFO L93 Difference]: Finished difference Result 1199 states and 2278 transitions. [2022-03-15 20:25:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:25:45,588 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:25:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:45,592 INFO L225 Difference]: With dead ends: 1199 [2022-03-15 20:25:45,592 INFO L226 Difference]: Without dead ends: 1169 [2022-03-15 20:25:45,592 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:25:45,592 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 83 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:45,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 60 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:25:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-03-15 20:25:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1043. [2022-03-15 20:25:45,621 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:25:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2011 transitions. [2022-03-15 20:25:45,623 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2011 transitions. Word has length 17 [2022-03-15 20:25:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:45,623 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 2011 transitions. [2022-03-15 20:25:45,623 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:25:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2011 transitions. [2022-03-15 20:25:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:45,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:45,624 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:25:45,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:25:45,624 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -657942141, now seen corresponding path program 1 times [2022-03-15 20:25:45,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:45,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058700748] [2022-03-15 20:25:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:45,960 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:25:45,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:45,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058700748] [2022-03-15 20:25:45,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058700748] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:45,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:45,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:45,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329078616] [2022-03-15 20:25:45,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:45,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:45,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 64 transitions. [2022-03-15 20:25:45,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:45,978 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:45,979 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:45,985 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:45,986 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:46,536 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:46,537 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:46,542 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:46,542 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:46,570 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:46,571 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:46,575 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:46,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:46,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [25615#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (= (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1)) |t_funThread1of1ForFork0_init_#t~nondet30#1|) (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 2))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 25616#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (= (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1)) |t_funThread1of1ForFork0_init_#t~nondet30#1|) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 25618#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 25617#(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~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:25:46,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:25:46,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:46,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:25:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:25:46,588 INFO L87 Difference]: Start difference. First operand 1043 states and 2011 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 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:25:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:48,119 INFO L93 Difference]: Finished difference Result 1746 states and 3375 transitions. [2022-03-15 20:25:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:25:48,120 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 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 20 [2022-03-15 20:25:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:48,125 INFO L225 Difference]: With dead ends: 1746 [2022-03-15 20:25:48,125 INFO L226 Difference]: Without dead ends: 1746 [2022-03-15 20:25:48,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2022-03-15 20:25:48,126 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 226 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:48,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 185 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:25:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-03-15 20:25:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1074. [2022-03-15 20:25:48,143 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:25:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2073 transitions. [2022-03-15 20:25:48,145 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2073 transitions. Word has length 20 [2022-03-15 20:25:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:48,145 INFO L470 AbstractCegarLoop]: Abstraction has 1074 states and 2073 transitions. [2022-03-15 20:25:48,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 16 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:25:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2073 transitions. [2022-03-15 20:25:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:48,145 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:48,145 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:25:48,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:25:48,146 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2054875004, now seen corresponding path program 1 times [2022-03-15 20:25:48,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:48,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354460242] [2022-03-15 20:25:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:48,280 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:25:48,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:48,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354460242] [2022-03-15 20:25:48,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354460242] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:48,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:48,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:25:48,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921577542] [2022-03-15 20:25:48,280 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:48,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:48,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 72 transitions. [2022-03-15 20:25:48,289 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:48,328 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:48,329 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:48,334 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:48,335 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:48,345 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:48,345 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:48,348 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:48,349 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:48,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29547#(or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0))] [2022-03-15 20:25:48,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:25:48,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:25:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:25:48,501 INFO L87 Difference]: Start difference. First operand 1074 states and 2073 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:25:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:49,158 INFO L93 Difference]: Finished difference Result 1104 states and 2096 transitions. [2022-03-15 20:25:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:25:49,158 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:25:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:49,162 INFO L225 Difference]: With dead ends: 1104 [2022-03-15 20:25:49,162 INFO L226 Difference]: Without dead ends: 1104 [2022-03-15 20:25:49,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:25:49,163 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 324 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:49,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 103 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:25:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-03-15 20:25:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1044. [2022-03-15 20:25:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1032 states have (on average 1.9505813953488371) internal successors, (2013), 1043 states have internal predecessors, (2013), 0 states have call successors, (0), 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:25:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2013 transitions. [2022-03-15 20:25:49,177 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2013 transitions. Word has length 20 [2022-03-15 20:25:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:49,177 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 2013 transitions. [2022-03-15 20:25:49,177 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:25:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2013 transitions. [2022-03-15 20:25:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:49,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:49,178 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:25:49,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:25:49,178 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1149906361, now seen corresponding path program 2 times [2022-03-15 20:25:49,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:49,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641984900] [2022-03-15 20:25:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:49,530 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:25:49,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:49,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641984900] [2022-03-15 20:25:49,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641984900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:49,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:49,530 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:49,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591134861] [2022-03-15 20:25:49,531 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:49,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:49,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 58 transitions. [2022-03-15 20:25:49,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:49,544 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,545 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:49,546 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,547 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:49,563 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,564 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:49,566 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,566 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:49,993 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,994 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:49,997 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:49,998 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:50,028 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [32775#(and (= |t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) |t_funThread1of1ForFork0_init_~p#1.offset|)) (= (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1)) |t_funThread1of1ForFork0_init_#t~nondet30#1|) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)) (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1) |ULTIMATE.start_main_#t~mem47#1.offset|))), 32776#(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~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)) (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1) |ULTIMATE.start_main_#t~mem47#1.offset|))), 32777#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)) (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1) |ULTIMATE.start_main_#t~mem47#1.offset|)))] [2022-03-15 20:25:50,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:25:50,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:25:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:25:50,029 INFO L87 Difference]: Start difference. First operand 1044 states and 2013 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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:25:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:52,038 INFO L93 Difference]: Finished difference Result 1724 states and 3329 transitions. [2022-03-15 20:25:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:25:52,038 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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:25:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:52,044 INFO L225 Difference]: With dead ends: 1724 [2022-03-15 20:25:52,044 INFO L226 Difference]: Without dead ends: 1724 [2022-03-15 20:25:52,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:25:52,045 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 220 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:52,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 179 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 20:25:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-03-15 20:25:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1053. [2022-03-15 20:25:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1041 states have (on average 1.9510086455331412) internal successors, (2031), 1052 states have internal predecessors, (2031), 0 states have call successors, (0), 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:25:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 2031 transitions. [2022-03-15 20:25:52,065 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 2031 transitions. Word has length 20 [2022-03-15 20:25:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:52,065 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 2031 transitions. [2022-03-15 20:25:52,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 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:25:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2031 transitions. [2022-03-15 20:25:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:52,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:52,066 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:25:52,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:25:52,067 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash -295349275, now seen corresponding path program 3 times [2022-03-15 20:25:52,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:52,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824826900] [2022-03-15 20:25:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:52,458 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:25:52,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:52,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824826900] [2022-03-15 20:25:52,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824826900] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:52,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:52,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:52,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118592308] [2022-03-15 20:25:52,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:52,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:52,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 52 transitions. [2022-03-15 20:25:52,465 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:52,471 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,474 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:52,475 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,476 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:52,488 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,489 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:52,491 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:52,702 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,702 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:25:52,704 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:52,705 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:25:52,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [36650#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)) (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1) |ULTIMATE.start_main_#t~mem47#1.offset|))), 36649#(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~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)) (not (= (+ |t_funThread1of1ForFork0_init_~p#1.offset| 1) |ULTIMATE.start_main_#t~mem47#1.offset|)))] [2022-03-15 20:25:52,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:52,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:52,798 INFO L87 Difference]: Start difference. First operand 1053 states and 2031 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:25:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:54,367 INFO L93 Difference]: Finished difference Result 1754 states and 3387 transitions. [2022-03-15 20:25:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:25:54,367 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:25:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:54,372 INFO L225 Difference]: With dead ends: 1754 [2022-03-15 20:25:54,372 INFO L226 Difference]: Without dead ends: 1754 [2022-03-15 20:25:54,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:25:54,373 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 246 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:54,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 138 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:25:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2022-03-15 20:25:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1062. [2022-03-15 20:25:54,388 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:25:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 2049 transitions. [2022-03-15 20:25:54,389 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 2049 transitions. Word has length 20 [2022-03-15 20:25:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:54,389 INFO L470 AbstractCegarLoop]: Abstraction has 1062 states and 2049 transitions. [2022-03-15 20:25:54,389 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:25:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 2049 transitions. [2022-03-15 20:25:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:54,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:54,390 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:25:54,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:25:54,390 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2048147463, now seen corresponding path program 4 times [2022-03-15 20:25:54,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:54,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886078253] [2022-03-15 20:25:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:54,738 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:25:54,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:54,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886078253] [2022-03-15 20:25:54,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886078253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:54,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:54,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:54,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170950003] [2022-03-15 20:25:54,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:54,740 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:54,745 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 46 transitions. [2022-03-15 20:25:54,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:54,823 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,824 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2022-03-15 20:25:54,828 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,830 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:54,839 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,840 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:54,842 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,843 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2022-03-15 20:25:54,853 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,854 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2022-03-15 20:25:54,858 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:54,858 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:54,910 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [40572#(and (not (<= (+ ~A~0.offset 1) |t_funThread1of1ForFork0_init_~p#1.offset|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)))] [2022-03-15 20:25:54,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:25:54,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:25:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:25:54,911 INFO L87 Difference]: Start difference. First operand 1062 states and 2049 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:25:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:56,232 INFO L93 Difference]: Finished difference Result 1515 states and 2928 transitions. [2022-03-15 20:25:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:25:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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 20 [2022-03-15 20:25:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:56,236 INFO L225 Difference]: With dead ends: 1515 [2022-03-15 20:25:56,237 INFO L226 Difference]: Without dead ends: 1515 [2022-03-15 20:25:56,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:25:56,237 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 162 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:56,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 150 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:25:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-03-15 20:25:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1071. [2022-03-15 20:25:56,252 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:25:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 2067 transitions. [2022-03-15 20:25:56,253 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 2067 transitions. Word has length 20 [2022-03-15 20:25:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:56,253 INFO L470 AbstractCegarLoop]: Abstraction has 1071 states and 2067 transitions. [2022-03-15 20:25:56,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:25:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2067 transitions. [2022-03-15 20:25:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:56,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:56,254 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:25:56,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:25:56,254 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1731223131, now seen corresponding path program 5 times [2022-03-15 20:25:56,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:56,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841371151] [2022-03-15 20:25:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:56,465 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:25:56,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:56,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841371151] [2022-03-15 20:25:56,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841371151] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:56,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:56,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:25:56,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584244516] [2022-03-15 20:25:56,466 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:56,467 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:56,471 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 20:25:56,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:56,477 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,478 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:56,483 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,484 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:56,499 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,499 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:56,502 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,503 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:56,570 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,580 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:56,583 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:56,584 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:56,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:56,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:25:56,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:56,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:25:56,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:25:56,594 INFO L87 Difference]: Start difference. First operand 1071 states and 2067 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:25:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:57,647 INFO L93 Difference]: Finished difference Result 2307 states and 4434 transitions. [2022-03-15 20:25:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:25:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:25:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:57,653 INFO L225 Difference]: With dead ends: 2307 [2022-03-15 20:25:57,653 INFO L226 Difference]: Without dead ends: 2307 [2022-03-15 20:25:57,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:57,654 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 316 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:57,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 177 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:25:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2022-03-15 20:25:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1079. [2022-03-15 20:25:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1067 states have (on average 1.9522024367385191) internal successors, (2083), 1078 states have internal predecessors, (2083), 0 states have call successors, (0), 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:25:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 2083 transitions. [2022-03-15 20:25:57,674 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 2083 transitions. Word has length 20 [2022-03-15 20:25:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:57,674 INFO L470 AbstractCegarLoop]: Abstraction has 1079 states and 2083 transitions. [2022-03-15 20:25:57,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:25:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 2083 transitions. [2022-03-15 20:25:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:57,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:57,675 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:25:57,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:25:57,675 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1358379414, now seen corresponding path program 1 times [2022-03-15 20:25:57,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:57,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217586315] [2022-03-15 20:25:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:57,883 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:25:57,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:57,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217586315] [2022-03-15 20:25:57,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217586315] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:57,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:57,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:57,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1905389078] [2022-03-15 20:25:57,884 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:57,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:57,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 20:25:57,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:57,897 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,897 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,899 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,900 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:57,910 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,911 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,913 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,914 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:57,926 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,927 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:25:57,931 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:25:57,931 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:25:57,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:25:57,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:25:57,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:25:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:25:57,939 INFO L87 Difference]: Start difference. First operand 1079 states and 2083 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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:25:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:25:59,405 INFO L93 Difference]: Finished difference Result 2416 states and 4574 transitions. [2022-03-15 20:25:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:25:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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:25:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:25:59,412 INFO L225 Difference]: With dead ends: 2416 [2022-03-15 20:25:59,412 INFO L226 Difference]: Without dead ends: 2416 [2022-03-15 20:25:59,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:25:59,412 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 369 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:25:59,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 177 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:25:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-03-15 20:25:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1139. [2022-03-15 20:25:59,430 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:25:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2203 transitions. [2022-03-15 20:25:59,432 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2203 transitions. Word has length 20 [2022-03-15 20:25:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:25:59,432 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 2203 transitions. [2022-03-15 20:25:59,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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:25:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2203 transitions. [2022-03-15 20:25:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:25:59,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:25:59,433 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:25:59,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 20:25:59,433 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:25:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:25:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -896432933, now seen corresponding path program 6 times [2022-03-15 20:25:59,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:25:59,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585925571] [2022-03-15 20:25:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:25:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:25:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:25:59,708 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:25:59,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:25:59,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585925571] [2022-03-15 20:25:59,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585925571] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:25:59,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:25:59,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:25:59,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222468243] [2022-03-15 20:25:59,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:25:59,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:25:59,713 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 28 transitions. [2022-03-15 20:25:59,713 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:25:59,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [53505#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0)))), 53506#(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:25:59,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:25:59,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:25:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:25:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:25:59,862 INFO L87 Difference]: Start difference. First operand 1139 states and 2203 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:26:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:01,429 INFO L93 Difference]: Finished difference Result 2019 states and 3914 transitions. [2022-03-15 20:26:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 20:26:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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 20 [2022-03-15 20:26:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:01,443 INFO L225 Difference]: With dead ends: 2019 [2022-03-15 20:26:01,443 INFO L226 Difference]: Without dead ends: 2019 [2022-03-15 20:26:01,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:26:01,444 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 345 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:01,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 315 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:26:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2022-03-15 20:26:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1145. [2022-03-15 20:26:01,459 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:26:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2215 transitions. [2022-03-15 20:26:01,461 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2215 transitions. Word has length 20 [2022-03-15 20:26:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:01,461 INFO L470 AbstractCegarLoop]: Abstraction has 1145 states and 2215 transitions. [2022-03-15 20:26:01,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:26:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2215 transitions. [2022-03-15 20:26:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:01,463 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:01,463 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:26:01,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 20:26:01,464 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:01,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2016010261, now seen corresponding path program 7 times [2022-03-15 20:26:01,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:01,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632765930] [2022-03-15 20:26:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:01,914 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:26:01,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:01,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632765930] [2022-03-15 20:26:01,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632765930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:01,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:01,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:01,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705341243] [2022-03-15 20:26:01,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:01,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:01,919 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 30 transitions. [2022-03-15 20:26:01,919 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:02,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:02,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:02,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:02,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:02,177 INFO L87 Difference]: Start difference. First operand 1145 states and 2215 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:26:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:03,566 INFO L93 Difference]: Finished difference Result 1805 states and 3507 transitions. [2022-03-15 20:26:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:26:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 20 [2022-03-15 20:26:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:03,569 INFO L225 Difference]: With dead ends: 1805 [2022-03-15 20:26:03,569 INFO L226 Difference]: Without dead ends: 1805 [2022-03-15 20:26:03,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:26:03,570 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 141 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:03,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 235 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:26:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2022-03-15 20:26:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1179. [2022-03-15 20:26:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1167 states have (on average 1.9562982005141387) internal successors, (2283), 1178 states have internal predecessors, (2283), 0 states have call successors, (0), 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:26:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2283 transitions. [2022-03-15 20:26:03,587 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2283 transitions. Word has length 20 [2022-03-15 20:26:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:03,588 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 2283 transitions. [2022-03-15 20:26:03,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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:26:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2283 transitions. [2022-03-15 20:26:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:03,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:03,589 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:26:03,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 20:26:03,589 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2053889563, now seen corresponding path program 8 times [2022-03-15 20:26:03,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:03,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405283257] [2022-03-15 20:26:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:03,905 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:26:03,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:03,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405283257] [2022-03-15 20:26:03,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405283257] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:03,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:03,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:03,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437105633] [2022-03-15 20:26:03,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:03,907 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:03,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 20:26:03,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:04,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:04,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:04,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:04,151 INFO L87 Difference]: Start difference. First operand 1179 states and 2283 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 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:26:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:05,698 INFO L93 Difference]: Finished difference Result 2133 states and 4138 transitions. [2022-03-15 20:26:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:26:05,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 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:26:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:05,702 INFO L225 Difference]: With dead ends: 2133 [2022-03-15 20:26:05,702 INFO L226 Difference]: Without dead ends: 2133 [2022-03-15 20:26:05,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-03-15 20:26:05,703 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 235 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:05,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 250 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:26:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2022-03-15 20:26:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1188. [2022-03-15 20:26:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1176 states have (on average 1.9566326530612246) internal successors, (2301), 1187 states have internal predecessors, (2301), 0 states have call successors, (0), 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:26:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 2301 transitions. [2022-03-15 20:26:05,720 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 2301 transitions. Word has length 20 [2022-03-15 20:26:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:05,720 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 2301 transitions. [2022-03-15 20:26:05,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 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:26:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 2301 transitions. [2022-03-15 20:26:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:05,721 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:05,721 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:26:05,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 20:26:05,721 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1402567415, now seen corresponding path program 9 times [2022-03-15 20:26:05,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:05,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247632417] [2022-03-15 20:26:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:05,944 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:26:05,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:05,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247632417] [2022-03-15 20:26:05,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247632417] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:05,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:05,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:05,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548536170] [2022-03-15 20:26:05,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:05,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:05,951 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 34 transitions. [2022-03-15 20:26:05,951 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:06,150 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [66613#(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))), 66612#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))))] [2022-03-15 20:26:06,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:06,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:06,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:06,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:06,152 INFO L87 Difference]: Start difference. First operand 1188 states and 2301 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:26:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:07,623 INFO L93 Difference]: Finished difference Result 2177 states and 4220 transitions. [2022-03-15 20:26:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:26:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 20 [2022-03-15 20:26:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:07,627 INFO L225 Difference]: With dead ends: 2177 [2022-03-15 20:26:07,627 INFO L226 Difference]: Without dead ends: 2177 [2022-03-15 20:26:07,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:26:07,628 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 377 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:07,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 276 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:26:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-03-15 20:26:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1197. [2022-03-15 20:26:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1185 states have (on average 1.9569620253164557) internal successors, (2319), 1196 states have internal predecessors, (2319), 0 states have call successors, (0), 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:26:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2319 transitions. [2022-03-15 20:26:07,655 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2319 transitions. Word has length 20 [2022-03-15 20:26:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:07,655 INFO L470 AbstractCegarLoop]: Abstraction has 1197 states and 2319 transitions. [2022-03-15 20:26:07,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:26:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2319 transitions. [2022-03-15 20:26:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:07,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:07,657 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:26:07,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 20:26:07,658 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1927996345, now seen corresponding path program 10 times [2022-03-15 20:26:07,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:07,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131862532] [2022-03-15 20:26:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:07,811 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:26:07,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:07,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131862532] [2022-03-15 20:26:07,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131862532] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:07,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:07,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:07,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518517504] [2022-03-15 20:26:07,811 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:07,813 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:07,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 56 transitions. [2022-03-15 20:26:07,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:07,822 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:07,823 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:07,825 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:07,826 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:07,841 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:07,842 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:07,846 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:07,846 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:08,065 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [71241#(or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))), 71242#(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))), 71239#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_init_#in~p#1.base|)), 71240#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0))] [2022-03-15 20:26:08,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:26:08,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:08,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:26:08,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:26:08,066 INFO L87 Difference]: Start difference. First operand 1197 states and 2319 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 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:26:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:09,623 INFO L93 Difference]: Finished difference Result 1906 states and 3665 transitions. [2022-03-15 20:26:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:26:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 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:26:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:09,626 INFO L225 Difference]: With dead ends: 1906 [2022-03-15 20:26:09,626 INFO L226 Difference]: Without dead ends: 1906 [2022-03-15 20:26:09,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 20:26:09,628 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 445 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:09,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 337 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:26:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2022-03-15 20:26:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1168. [2022-03-15 20:26:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1156 states have (on average 1.9567474048442905) internal successors, (2262), 1167 states have internal predecessors, (2262), 0 states have call successors, (0), 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:26:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2262 transitions. [2022-03-15 20:26:09,649 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2262 transitions. Word has length 20 [2022-03-15 20:26:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:09,649 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2262 transitions. [2022-03-15 20:26:09,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 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:26:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2262 transitions. [2022-03-15 20:26:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:09,662 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:09,662 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:26:09,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:26:09,663 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1994127234, now seen corresponding path program 2 times [2022-03-15 20:26:09,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:09,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995785935] [2022-03-15 20:26:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:09,828 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:26:09,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:09,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995785935] [2022-03-15 20:26:09,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995785935] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:09,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:09,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:09,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766671096] [2022-03-15 20:26:09,828 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:09,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:09,834 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:26:09,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:09,838 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:09,839 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:09,843 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:09,843 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:09,880 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:09,881 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:09,885 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:09,886 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:10,059 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [75538#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_init_#in~p#1.base|)), 75541#(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))), 75539#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 75540#(or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0)))] [2022-03-15 20:26:10,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:26:10,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:10,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:26:10,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:26:10,060 INFO L87 Difference]: Start difference. First operand 1168 states and 2262 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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:26:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:11,726 INFO L93 Difference]: Finished difference Result 1971 states and 3749 transitions. [2022-03-15 20:26:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:26:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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:26:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:11,729 INFO L225 Difference]: With dead ends: 1971 [2022-03-15 20:26:11,729 INFO L226 Difference]: Without dead ends: 1971 [2022-03-15 20:26:11,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:26:11,730 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 518 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:11,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 297 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:26:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2022-03-15 20:26:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1043. [2022-03-15 20:26:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1032 states have (on average 1.949612403100775) internal successors, (2012), 1042 states have internal predecessors, (2012), 0 states have call successors, (0), 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:26:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2012 transitions. [2022-03-15 20:26:11,749 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2012 transitions. Word has length 20 [2022-03-15 20:26:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:11,749 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 2012 transitions. [2022-03-15 20:26:11,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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:26:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2012 transitions. [2022-03-15 20:26:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:11,749 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:11,750 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:26:11,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:26:11,750 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1111866288, now seen corresponding path program 3 times [2022-03-15 20:26:11,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:11,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479507065] [2022-03-15 20:26:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:11,886 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:26:11,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:11,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479507065] [2022-03-15 20:26:11,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479507065] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:11,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:11,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:11,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884264460] [2022-03-15 20:26:11,886 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:11,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:11,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:26:11,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:12,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [79644#(or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))), 79646#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|))), 79645#(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))), 79647#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|)), 79643#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0))] [2022-03-15 20:26:12,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:26:12,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:12,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:26:12,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:26:12,181 INFO L87 Difference]: Start difference. First operand 1043 states and 2012 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:26:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:14,726 INFO L93 Difference]: Finished difference Result 2625 states and 4957 transitions. [2022-03-15 20:26:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:26:14,727 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:26:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:14,730 INFO L225 Difference]: With dead ends: 2625 [2022-03-15 20:26:14,730 INFO L226 Difference]: Without dead ends: 2625 [2022-03-15 20:26:14,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1316, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 20:26:14,731 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 590 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 4108 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 4300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 4108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:14,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 396 Invalid, 4300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4108 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 20:26:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2022-03-15 20:26:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 1047. [2022-03-15 20:26:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1036 states have (on average 1.94980694980695) internal successors, (2020), 1046 states have internal predecessors, (2020), 0 states have call successors, (0), 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:26:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2020 transitions. [2022-03-15 20:26:14,747 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2020 transitions. Word has length 20 [2022-03-15 20:26:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:14,747 INFO L470 AbstractCegarLoop]: Abstraction has 1047 states and 2020 transitions. [2022-03-15 20:26:14,747 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:26:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2020 transitions. [2022-03-15 20:26:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:14,748 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:14,748 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:26:14,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:26:14,748 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:14,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:14,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1238017919, now seen corresponding path program 11 times [2022-03-15 20:26:14,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:14,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533615382] [2022-03-15 20:26:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:15,113 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:26:15,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:15,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533615382] [2022-03-15 20:26:15,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533615382] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:15,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:15,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:15,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388796560] [2022-03-15 20:26:15,114 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:15,116 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:15,119 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 30 transitions. [2022-03-15 20:26:15,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:15,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [84428#(and (= |t_funThread1of1ForFork0_init_#in~p#1.offset| 0) (not (= ~A~0.base |t_funThread1of1ForFork0_init_#in~p#1.base|)) (<= 0 ~A~0.offset) (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)))))] [2022-03-15 20:26:15,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:15,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:15,215 INFO L87 Difference]: Start difference. First operand 1047 states and 2020 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:26:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:16,627 INFO L93 Difference]: Finished difference Result 1917 states and 3708 transitions. [2022-03-15 20:26:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:26:16,628 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 20 [2022-03-15 20:26:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:16,631 INFO L225 Difference]: With dead ends: 1917 [2022-03-15 20:26:16,631 INFO L226 Difference]: Without dead ends: 1917 [2022-03-15 20:26:16,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:26:16,632 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 292 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:16,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 261 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:26:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-03-15 20:26:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1042. [2022-03-15 20:26:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1031 states have (on average 1.9495635305528614) internal successors, (2010), 1041 states have internal predecessors, (2010), 0 states have call successors, (0), 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:26:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2010 transitions. [2022-03-15 20:26:16,653 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2010 transitions. Word has length 20 [2022-03-15 20:26:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:16,670 INFO L470 AbstractCegarLoop]: Abstraction has 1042 states and 2010 transitions. [2022-03-15 20:26:16,670 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:26:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2010 transitions. [2022-03-15 20:26:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:16,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:16,671 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:26:16,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:26:16,671 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1200138617, now seen corresponding path program 12 times [2022-03-15 20:26:16,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:16,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145671446] [2022-03-15 20:26:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:16,915 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:26:16,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:16,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145671446] [2022-03-15 20:26:16,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145671446] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:16,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:16,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:16,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310980967] [2022-03-15 20:26:16,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:16,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:16,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 20:26:16,920 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:16,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [88479#(and (not (= ~A~0.base |t_funThread1of1ForFork0_init_#in~p#1.base|)) (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)))))] [2022-03-15 20:26:16,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:16,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:16,992 INFO L87 Difference]: Start difference. First operand 1042 states and 2010 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:26:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:18,384 INFO L93 Difference]: Finished difference Result 1914 states and 3702 transitions. [2022-03-15 20:26:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 20:26:18,384 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:26:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:18,387 INFO L225 Difference]: With dead ends: 1914 [2022-03-15 20:26:18,388 INFO L226 Difference]: Without dead ends: 1914 [2022-03-15 20:26:18,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:26:18,388 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 315 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:18,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 278 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:26:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2022-03-15 20:26:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 990. [2022-03-15 20:26:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 980 states have (on average 1.9489795918367347) internal successors, (1910), 989 states have internal predecessors, (1910), 0 states have call successors, (0), 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:26:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1910 transitions. [2022-03-15 20:26:18,402 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1910 transitions. Word has length 20 [2022-03-15 20:26:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:18,403 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 1910 transitions. [2022-03-15 20:26:18,403 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:26:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1910 transitions. [2022-03-15 20:26:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 20:26:18,403 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:18,403 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:26:18,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:26:18,403 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -388573398, now seen corresponding path program 4 times [2022-03-15 20:26:18,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:18,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271620371] [2022-03-15 20:26:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:18,594 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:26:18,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:18,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271620371] [2022-03-15 20:26:18,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271620371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:18,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:18,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:18,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691431987] [2022-03-15 20:26:18,595 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:18,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:18,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2022-03-15 20:26:18,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:18,627 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:18,628 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:18,641 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:18,642 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:18,870 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [92430#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_init_#in~p#1.base|))), 92437#(not (= |t_funThread1of1ForFork0_init_#in~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)), 92435#(or (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| |ULTIMATE.start_main_#t~mem47#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))), 92431#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|)), 92429#(and (= (select (select |#race| |ULTIMATE.start_main_~p~1#1.base|) |ULTIMATE.start_main_~p~1#1.offset|) 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_~p~1#1.base|))), 92432#(not (= |ULTIMATE.start_main_~p~1#1.base| |t_funThread1of1ForFork0_init_#in~p#1.base|)), 92436#(or (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))), 92433#(or (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| |ULTIMATE.start_main_#t~mem47#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))), 92434#(or (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| |ULTIMATE.start_main_#t~mem47#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))), 92438#(not (= |t_funThread1of1ForFork0_init_#in~p#1.base| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4))))] [2022-03-15 20:26:18,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 20:26:18,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:18,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 20:26:18,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 20:26:18,871 INFO L87 Difference]: Start difference. First operand 990 states and 1910 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:21,812 INFO L93 Difference]: Finished difference Result 2428 states and 4554 transitions. [2022-03-15 20:26:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 20:26:21,813 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 20:26:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:21,815 INFO L225 Difference]: With dead ends: 2428 [2022-03-15 20:26:21,815 INFO L226 Difference]: Without dead ends: 2428 [2022-03-15 20:26:21,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=456, Invalid=2406, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 20:26:21,816 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 649 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 4684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:21,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [649 Valid, 395 Invalid, 4684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 20:26:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-03-15 20:26:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 852. [2022-03-15 20:26:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 843 states have (on average 1.9383155397390273) internal successors, (1634), 851 states have internal predecessors, (1634), 0 states have call successors, (0), 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:26:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1634 transitions. [2022-03-15 20:26:21,836 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1634 transitions. Word has length 20 [2022-03-15 20:26:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:21,836 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1634 transitions. [2022-03-15 20:26:21,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1634 transitions. [2022-03-15 20:26:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:21,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:21,837 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:26:21,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:26:21,837 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1859114324, now seen corresponding path program 1 times [2022-03-15 20:26:21,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:21,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169765400] [2022-03-15 20:26:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:22,085 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:26:22,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:22,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169765400] [2022-03-15 20:26:22,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169765400] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:22,086 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:22,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:22,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [81345080] [2022-03-15 20:26:22,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:22,089 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:22,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 70 transitions. [2022-03-15 20:26:22,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:22,104 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,104 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:22,108 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,108 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:22,116 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,116 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:22,120 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,120 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:22,133 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,133 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:22,136 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:22,137 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:22,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:22,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:22,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:22,292 INFO L87 Difference]: Start difference. First operand 852 states and 1634 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:26:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:23,243 INFO L93 Difference]: Finished difference Result 1368 states and 2632 transitions. [2022-03-15 20:26:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:26:23,244 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:26:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:23,245 INFO L225 Difference]: With dead ends: 1368 [2022-03-15 20:26:23,245 INFO L226 Difference]: Without dead ends: 1368 [2022-03-15 20:26:23,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:26:23,246 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 178 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:23,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 124 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:26:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-03-15 20:26:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 912. [2022-03-15 20:26:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 903 states have (on average 1.9424141749723145) internal successors, (1754), 911 states have internal predecessors, (1754), 0 states have call successors, (0), 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:26:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1754 transitions. [2022-03-15 20:26:23,256 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1754 transitions. Word has length 26 [2022-03-15 20:26:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:23,256 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1754 transitions. [2022-03-15 20:26:23,257 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:26:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1754 transitions. [2022-03-15 20:26:23,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:23,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:23,257 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:26:23,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:26:23,257 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash -932909620, now seen corresponding path program 2 times [2022-03-15 20:26:23,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:23,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908751008] [2022-03-15 20:26:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:23,480 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:26:23,480 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:23,480 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908751008] [2022-03-15 20:26:23,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908751008] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:23,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:23,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:23,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168867180] [2022-03-15 20:26:23,481 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:23,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:23,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 72 transitions. [2022-03-15 20:26:23,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:23,578 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,578 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:23,581 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:23,621 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,621 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:23,625 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,626 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:23,636 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,636 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:23,639 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:23,639 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:23,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:23,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 20:26:23,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 20:26:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 20:26:23,702 INFO L87 Difference]: Start difference. First operand 912 states and 1754 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:26:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:24,721 INFO L93 Difference]: Finished difference Result 1176 states and 2250 transitions. [2022-03-15 20:26:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:26:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:26:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:24,723 INFO L225 Difference]: With dead ends: 1176 [2022-03-15 20:26:24,723 INFO L226 Difference]: Without dead ends: 1176 [2022-03-15 20:26:24,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:26:24,724 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 187 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:24,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 156 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-03-15 20:26:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 917. [2022-03-15 20:26:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 908 states have (on average 1.9427312775330396) internal successors, (1764), 916 states have internal predecessors, (1764), 0 states have call successors, (0), 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:26:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1764 transitions. [2022-03-15 20:26:24,744 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1764 transitions. Word has length 26 [2022-03-15 20:26:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:24,744 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1764 transitions. [2022-03-15 20:26:24,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:26:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1764 transitions. [2022-03-15 20:26:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:24,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:24,745 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:26:24,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:26:24,745 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 900283348, now seen corresponding path program 3 times [2022-03-15 20:26:24,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:24,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719483399] [2022-03-15 20:26:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:24,980 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:26:24,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:24,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719483399] [2022-03-15 20:26:24,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719483399] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:24,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:24,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:24,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [977014131] [2022-03-15 20:26:24,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:24,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:24,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 74 transitions. [2022-03-15 20:26:24,993 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:25,091 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,092 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:25,093 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,094 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:25,102 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,102 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:25,104 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,105 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:25,123 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,124 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:25,127 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:25,127 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:25,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:25,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:25,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:25,204 INFO L87 Difference]: Start difference. First operand 917 states and 1764 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:26:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:26,189 INFO L93 Difference]: Finished difference Result 1404 states and 2700 transitions. [2022-03-15 20:26:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:26:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 26 [2022-03-15 20:26:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:26,191 INFO L225 Difference]: With dead ends: 1404 [2022-03-15 20:26:26,191 INFO L226 Difference]: Without dead ends: 1404 [2022-03-15 20:26:26,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:26:26,192 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:26,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 115 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-03-15 20:26:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 922. [2022-03-15 20:26:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 913 states have (on average 1.9430449069003286) internal successors, (1774), 921 states have internal predecessors, (1774), 0 states have call successors, (0), 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:26:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1774 transitions. [2022-03-15 20:26:26,202 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1774 transitions. Word has length 26 [2022-03-15 20:26:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:26,202 INFO L470 AbstractCegarLoop]: Abstraction has 922 states and 1774 transitions. [2022-03-15 20:26:26,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:26:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1774 transitions. [2022-03-15 20:26:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:26,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:26,203 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:26:26,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:26:26,203 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1669547852, now seen corresponding path program 4 times [2022-03-15 20:26:26,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:26,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159882848] [2022-03-15 20:26:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:26,449 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:26:26,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:26,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159882848] [2022-03-15 20:26:26,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159882848] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:26,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:26,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:26,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733411459] [2022-03-15 20:26:26,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:26,452 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:26,474 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 76 transitions. [2022-03-15 20:26:26,474 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:26,545 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,546 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:26,548 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,548 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:26,573 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,573 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:26,576 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,576 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:26,587 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,588 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:26,591 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:26,592 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:26,671 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:26,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:26,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:26,672 INFO L87 Difference]: Start difference. First operand 922 states and 1774 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:27,589 INFO L93 Difference]: Finished difference Result 1422 states and 2734 transitions. [2022-03-15 20:26:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:26:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:27,591 INFO L225 Difference]: With dead ends: 1422 [2022-03-15 20:26:27,591 INFO L226 Difference]: Without dead ends: 1422 [2022-03-15 20:26:27,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:26:27,592 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 162 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:27,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 114 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:26:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-03-15 20:26:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 927. [2022-03-15 20:26:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 918 states have (on average 1.943355119825708) internal successors, (1784), 926 states have internal predecessors, (1784), 0 states have call successors, (0), 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:26:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1784 transitions. [2022-03-15 20:26:27,602 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1784 transitions. Word has length 26 [2022-03-15 20:26:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:27,603 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1784 transitions. [2022-03-15 20:26:27,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1784 transitions. [2022-03-15 20:26:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:27,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:27,603 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:26:27,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:26:27,604 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash 995719814, now seen corresponding path program 5 times [2022-03-15 20:26:27,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:27,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72473258] [2022-03-15 20:26:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:27,985 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:26:27,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:27,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72473258] [2022-03-15 20:26:27,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72473258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:27,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:27,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:27,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970905718] [2022-03-15 20:26:27,988 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:27,991 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:28,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 86 transitions. [2022-03-15 20:26:28,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:28,406 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,407 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2022-03-15 20:26:28,408 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,409 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2022-03-15 20:26:28,422 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,423 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2022-03-15 20:26:28,425 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,426 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2022-03-15 20:26:28,447 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,448 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:28,490 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:28,526 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,527 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2022-03-15 20:26:28,529 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:28,529 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2022-03-15 20:26:28,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:28,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:28,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:28,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:28,594 INFO L87 Difference]: Start difference. First operand 927 states and 1784 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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:26:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:30,587 INFO L93 Difference]: Finished difference Result 1873 states and 3583 transitions. [2022-03-15 20:26:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 20:26:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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 26 [2022-03-15 20:26:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:30,589 INFO L225 Difference]: With dead ends: 1873 [2022-03-15 20:26:30,590 INFO L226 Difference]: Without dead ends: 1873 [2022-03-15 20:26:30,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:26:30,590 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 270 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:30,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 155 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:26:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2022-03-15 20:26:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 949. [2022-03-15 20:26:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 940 states have (on average 1.9446808510638298) internal successors, (1828), 948 states have internal predecessors, (1828), 0 states have call successors, (0), 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:26:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1828 transitions. [2022-03-15 20:26:30,602 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1828 transitions. Word has length 26 [2022-03-15 20:26:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:30,602 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1828 transitions. [2022-03-15 20:26:30,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 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:26:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1828 transitions. [2022-03-15 20:26:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:30,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:30,606 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:26:30,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 20:26:30,606 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1403569964, now seen corresponding path program 6 times [2022-03-15 20:26:30,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:30,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795416663] [2022-03-15 20:26:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:30,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:30,900 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:26:30,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:30,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795416663] [2022-03-15 20:26:30,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795416663] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:30,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:30,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:30,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1077294993] [2022-03-15 20:26:30,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:30,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:30,915 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 106 transitions. [2022-03-15 20:26:30,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:31,026 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,027 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,161 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,162 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,281 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,282 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:31,286 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,287 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,294 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,295 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:31,298 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,299 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,306 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,306 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,308 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,308 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:31,413 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:31,414 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:31,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [113318#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 5))) (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 6))) (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 113321#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 113319#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 5))) (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 113320#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:26:31,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:26:31,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:26:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:26:31,621 INFO L87 Difference]: Start difference. First operand 949 states and 1828 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 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:26:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:32,976 INFO L93 Difference]: Finished difference Result 1448 states and 2786 transitions. [2022-03-15 20:26:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:26:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 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:26:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:32,978 INFO L225 Difference]: With dead ends: 1448 [2022-03-15 20:26:32,978 INFO L226 Difference]: Without dead ends: 1448 [2022-03-15 20:26:32,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:26:32,979 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 190 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:32,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 194 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:26:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2022-03-15 20:26:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 964. [2022-03-15 20:26:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 955 states have (on average 1.9455497382198952) 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:26:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1858 transitions. [2022-03-15 20:26:32,989 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1858 transitions. Word has length 26 [2022-03-15 20:26:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:32,990 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1858 transitions. [2022-03-15 20:26:32,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 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:26:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1858 transitions. [2022-03-15 20:26:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:32,990 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:32,990 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:26:32,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 20:26:32,996 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2117157464, now seen corresponding path program 7 times [2022-03-15 20:26:32,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:32,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245365240] [2022-03-15 20:26:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:33,389 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:26:33,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:33,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245365240] [2022-03-15 20:26:33,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245365240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:33,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:33,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:33,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858251308] [2022-03-15 20:26:33,390 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:33,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:33,403 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 100 transitions. [2022-03-15 20:26:33,404 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:33,702 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,702 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:33,723 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,724 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:33,735 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,736 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:33,768 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,768 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2022-03-15 20:26:33,773 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,773 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:33,782 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,782 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:33,786 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:33,787 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2022-03-15 20:26:34,093 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:34,094 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2022-03-15 20:26:34,100 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:34,100 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:34,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [116746#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 5))) (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (= |t_funThread1of1ForFork0_init_~p#1.offset| 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 116748#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (= |t_funThread1of1ForFork0_init_~p#1.offset| 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 116747#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (= |t_funThread1of1ForFork0_init_~p#1.offset| 0) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:26:34,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 20:26:34,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:34,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 20:26:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:26:34,132 INFO L87 Difference]: Start difference. First operand 964 states and 1858 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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:26:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:35,879 INFO L93 Difference]: Finished difference Result 1452 states and 2793 transitions. [2022-03-15 20:26:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:26:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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:26:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:35,881 INFO L225 Difference]: With dead ends: 1452 [2022-03-15 20:26:35,881 INFO L226 Difference]: Without dead ends: 1452 [2022-03-15 20:26:35,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:26:35,882 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 193 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:35,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 180 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:26:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2022-03-15 20:26:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 959. [2022-03-15 20:26:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 950 states have (on average 1.9452631578947368) internal successors, (1848), 958 states have internal predecessors, (1848), 0 states have call successors, (0), 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:26:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1848 transitions. [2022-03-15 20:26:35,894 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1848 transitions. Word has length 26 [2022-03-15 20:26:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:35,894 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 1848 transitions. [2022-03-15 20:26:35,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 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:26:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1848 transitions. [2022-03-15 20:26:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:35,899 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:35,899 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:26:35,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 20:26:35,899 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash -266441068, now seen corresponding path program 8 times [2022-03-15 20:26:35,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:35,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394397788] [2022-03-15 20:26:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:36,275 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:26:36,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:36,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394397788] [2022-03-15 20:26:36,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394397788] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:36,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:36,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:36,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607890049] [2022-03-15 20:26:36,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:36,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:36,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 94 transitions. [2022-03-15 20:26:36,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:36,356 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,356 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:36,461 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,461 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:36,551 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,552 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:36,738 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,738 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:26:36,741 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,741 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:26:36,756 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,757 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:26:36,759 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,760 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:26:36,780 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,781 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2022-03-15 20:26:36,782 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:36,783 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2022-03-15 20:26:36,936 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [120161#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |ULTIMATE.start_main_#t~mem47#1.offset| (+ 7 |t_funThread1of1ForFork0_init_~p#1.offset|))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base))), 120160#(and (= |t_funThread1of1ForFork0_init_#t~nondet31#1| (select (select |#race| |t_funThread1of1ForFork0_init_~p#1.base|) (+ |t_funThread1of1ForFork0_init_~p#1.offset| 4))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |ULTIMATE.start_main_#t~mem47#1.offset| (+ 7 |t_funThread1of1ForFork0_init_~p#1.offset|))) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:26:36,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:36,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:36,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:36,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:36,937 INFO L87 Difference]: Start difference. First operand 959 states and 1848 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:38,207 INFO L93 Difference]: Finished difference Result 1483 states and 2851 transitions. [2022-03-15 20:26:38,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:26:38,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 20:26:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:38,236 INFO L225 Difference]: With dead ends: 1483 [2022-03-15 20:26:38,236 INFO L226 Difference]: Without dead ends: 1483 [2022-03-15 20:26:38,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-03-15 20:26:38,237 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 186 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:38,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 132 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:26:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-03-15 20:26:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 954. [2022-03-15 20:26:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 945 states have (on average 1.944973544973545) internal successors, (1838), 953 states have internal predecessors, (1838), 0 states have call successors, (0), 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:26:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1838 transitions. [2022-03-15 20:26:38,247 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1838 transitions. Word has length 26 [2022-03-15 20:26:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:38,247 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1838 transitions. [2022-03-15 20:26:38,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:26:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1838 transitions. [2022-03-15 20:26:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:38,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:38,248 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:26:38,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-15 20:26:38,248 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1371645928, now seen corresponding path program 9 times [2022-03-15 20:26:38,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:38,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134122977] [2022-03-15 20:26:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:38,474 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:26:38,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:38,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134122977] [2022-03-15 20:26:38,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134122977] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:38,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:38,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:38,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821390278] [2022-03-15 20:26:38,475 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:38,479 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:38,491 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 88 transitions. [2022-03-15 20:26:38,491 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:38,517 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,518 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,576 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,576 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,646 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,647 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,720 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,721 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:38,724 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,724 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,731 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,731 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,733 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,734 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:38,743 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,743 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:38,745 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:38,746 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:38,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [123585#(and (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| ~A~0.base)))] [2022-03-15 20:26:38,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:38,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:38,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:38,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:38,836 INFO L87 Difference]: Start difference. First operand 954 states and 1838 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:26:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:39,877 INFO L93 Difference]: Finished difference Result 1259 states and 2408 transitions. [2022-03-15 20:26:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 20:26:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 26 [2022-03-15 20:26:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:39,879 INFO L225 Difference]: With dead ends: 1259 [2022-03-15 20:26:39,879 INFO L226 Difference]: Without dead ends: 1259 [2022-03-15 20:26:39,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:26:39,879 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 202 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:39,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 162 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 20:26:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-03-15 20:26:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 949. [2022-03-15 20:26:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 940 states have (on average 1.9446808510638298) internal successors, (1828), 948 states have internal predecessors, (1828), 0 states have call successors, (0), 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:26:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1828 transitions. [2022-03-15 20:26:39,889 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1828 transitions. Word has length 26 [2022-03-15 20:26:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:39,889 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1828 transitions. [2022-03-15 20:26:39,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:26:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1828 transitions. [2022-03-15 20:26:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:39,890 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:39,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:39,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-15 20:26:39,890 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1914756780, now seen corresponding path program 10 times [2022-03-15 20:26:39,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:39,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85128459] [2022-03-15 20:26:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:40,162 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:26:40,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:40,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85128459] [2022-03-15 20:26:40,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85128459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:40,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:40,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:40,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123620897] [2022-03-15 20:26:40,162 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:40,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:40,177 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 34 transitions. [2022-03-15 20:26:40,177 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:40,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [126787#(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))), 126786#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))))] [2022-03-15 20:26:40,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:40,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:40,337 INFO L87 Difference]: Start difference. First operand 949 states and 1828 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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:26:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:41,572 INFO L93 Difference]: Finished difference Result 1711 states and 3305 transitions. [2022-03-15 20:26:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:26:41,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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:26:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:41,574 INFO L225 Difference]: With dead ends: 1711 [2022-03-15 20:26:41,574 INFO L226 Difference]: Without dead ends: 1711 [2022-03-15 20:26:41,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2022-03-15 20:26:41,575 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 337 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:41,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 266 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2022-03-15 20:26:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 944. [2022-03-15 20:26:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 935 states have (on average 1.9443850267379679) internal successors, (1818), 943 states have internal predecessors, (1818), 0 states have call successors, (0), 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:26:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1818 transitions. [2022-03-15 20:26:41,586 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1818 transitions. Word has length 26 [2022-03-15 20:26:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:41,586 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1818 transitions. [2022-03-15 20:26:41,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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:26:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1818 transitions. [2022-03-15 20:26:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:41,587 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:41,587 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:26:41,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-15 20:26:41,587 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -877267164, now seen corresponding path program 11 times [2022-03-15 20:26:41,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:41,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838262776] [2022-03-15 20:26:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:41,888 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:26:41,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:41,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838262776] [2022-03-15 20:26:41,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838262776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:41,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:41,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-15 20:26:41,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672772381] [2022-03-15 20:26:41,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:41,892 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:41,897 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 36 transitions. [2022-03-15 20:26:41,897 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:42,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:42,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:42,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:42,126 INFO L87 Difference]: Start difference. First operand 944 states and 1818 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:26:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:43,378 INFO L93 Difference]: Finished difference Result 1696 states and 3279 transitions. [2022-03-15 20:26:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:26:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 26 [2022-03-15 20:26:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:43,380 INFO L225 Difference]: With dead ends: 1696 [2022-03-15 20:26:43,380 INFO L226 Difference]: Without dead ends: 1696 [2022-03-15 20:26:43,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:26:43,381 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 189 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:43,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 223 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:26:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2022-03-15 20:26:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 994. [2022-03-15 20:26:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 985 states have (on average 1.947208121827411) internal successors, (1918), 993 states have internal predecessors, (1918), 0 states have call successors, (0), 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:26:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1918 transitions. [2022-03-15 20:26:43,392 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1918 transitions. Word has length 26 [2022-03-15 20:26:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:43,392 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1918 transitions. [2022-03-15 20:26:43,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:26:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1918 transitions. [2022-03-15 20:26:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:43,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:43,393 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:26:43,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-15 20:26:43,393 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash 955925804, now seen corresponding path program 12 times [2022-03-15 20:26:43,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:43,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487742144] [2022-03-15 20:26:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:43,612 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:26:43,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:43,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487742144] [2022-03-15 20:26:43,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487742144] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:43,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:43,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:43,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506640270] [2022-03-15 20:26:43,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:43,615 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:43,621 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 38 transitions. [2022-03-15 20:26:43,621 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:43,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [134149#(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))), 134148#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))))] [2022-03-15 20:26:43,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:43,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:43,786 INFO L87 Difference]: Start difference. First operand 994 states and 1918 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:26:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:45,426 INFO L93 Difference]: Finished difference Result 1827 states and 3530 transitions. [2022-03-15 20:26:45,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:26:45,427 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 26 [2022-03-15 20:26:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:45,429 INFO L225 Difference]: With dead ends: 1827 [2022-03-15 20:26:45,429 INFO L226 Difference]: Without dead ends: 1827 [2022-03-15 20:26:45,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:26:45,430 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 312 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:45,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 304 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:26:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2022-03-15 20:26:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 989. [2022-03-15 20:26:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.9469387755102041) internal successors, (1908), 988 states have internal predecessors, (1908), 0 states have call successors, (0), 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:26:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1908 transitions. [2022-03-15 20:26:45,442 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1908 transitions. Word has length 26 [2022-03-15 20:26:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:45,443 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1908 transitions. [2022-03-15 20:26:45,443 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:26:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1908 transitions. [2022-03-15 20:26:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:45,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:45,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:26:45,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-15 20:26:45,444 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1725190308, now seen corresponding path program 13 times [2022-03-15 20:26:45,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:45,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551589469] [2022-03-15 20:26:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:45,982 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:26:45,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:45,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551589469] [2022-03-15 20:26:45,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551589469] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:45,982 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:45,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:45,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172688202] [2022-03-15 20:26:45,982 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:45,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:45,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 40 transitions. [2022-03-15 20:26:45,991 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:46,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-03-15 20:26:46,306 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 20:26:46,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [138002#(and (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (and (not (= ~A~0.base |ULTIMATE.start_main_#t~mem47#1.base|)) (= |ULTIMATE.start_main_#t~mem47#1.offset| 0))) (<= |ULTIMATE.start_main_#t~mem47#1.offset| 0) (<= 0 ~A~0.offset)), 138003#(and (<= (select (select |#memory_$Pointer$.offset| ~A~0.base) (+ ~A~0.offset 4)) 0) (or (= (select (select |#memory_$Pointer$.offset| ~A~0.base) (+ ~A~0.offset 4)) 0) (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0)) (<= 0 ~A~0.offset) (or (not (= ~A~0.base (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)))) (= (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)) 0)))] [2022-03-15 20:26:46,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:26:46,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:26:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:26:46,369 INFO L87 Difference]: Start difference. First operand 989 states and 1908 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:47,957 INFO L93 Difference]: Finished difference Result 1674 states and 3260 transitions. [2022-03-15 20:26:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:26:47,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:47,959 INFO L225 Difference]: With dead ends: 1674 [2022-03-15 20:26:47,960 INFO L226 Difference]: Without dead ends: 1674 [2022-03-15 20:26:47,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:26:47,960 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 263 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:47,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 234 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2022-03-15 20:26:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1002. [2022-03-15 20:26:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 993 states have (on average 1.947633434038268) 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:26:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1934 transitions. [2022-03-15 20:26:47,972 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1934 transitions. Word has length 26 [2022-03-15 20:26:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:47,972 INFO L470 AbstractCegarLoop]: Abstraction has 1002 states and 1934 transitions. [2022-03-15 20:26:47,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1934 transitions. [2022-03-15 20:26:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:47,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:47,973 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:26:47,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-15 20:26:47,973 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:47,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:47,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1051362270, now seen corresponding path program 14 times [2022-03-15 20:26:47,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:47,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244354280] [2022-03-15 20:26:47,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:48,143 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:26:48,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:48,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244354280] [2022-03-15 20:26:48,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244354280] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:48,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:48,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:48,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671217189] [2022-03-15 20:26:48,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:48,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:48,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 50 transitions. [2022-03-15 20:26:48,154 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:48,223 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:48,223 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:48,235 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:48,236 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:48,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [141729#(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))), 141728#(or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0)))] [2022-03-15 20:26:48,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:48,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:48,330 INFO L87 Difference]: Start difference. First operand 1002 states and 1934 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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:26:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:49,339 INFO L93 Difference]: Finished difference Result 1712 states and 3284 transitions. [2022-03-15 20:26:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:26:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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 26 [2022-03-15 20:26:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:49,342 INFO L225 Difference]: With dead ends: 1712 [2022-03-15 20:26:49,342 INFO L226 Difference]: Without dead ends: 1712 [2022-03-15 20:26:49,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:26:49,342 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 221 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:49,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 366 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:26:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-03-15 20:26:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1037. [2022-03-15 20:26:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1028 states have (on average 1.9494163424124513) internal successors, (2004), 1036 states have internal predecessors, (2004), 0 states have call successors, (0), 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:26:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2004 transitions. [2022-03-15 20:26:49,355 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2004 transitions. Word has length 26 [2022-03-15 20:26:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:49,355 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 2004 transitions. [2022-03-15 20:26:49,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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:26:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2004 transitions. [2022-03-15 20:26:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:49,356 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:49,356 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:26:49,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-15 20:26:49,356 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1205192540, now seen corresponding path program 15 times [2022-03-15 20:26:49,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:49,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332532557] [2022-03-15 20:26:49,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:49,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:49,539 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:26:49,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:49,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332532557] [2022-03-15 20:26:49,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332532557] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:49,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:49,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-15 20:26:49,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891896732] [2022-03-15 20:26:49,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:49,542 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:49,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 40 transitions. [2022-03-15 20:26:49,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:49,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [145536#(and (or (not (= (select |#valid| ~A~0.base) 0)) (= ~A~0.base 0)) (or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0)))), 145537#(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:26:49,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:49,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:49,729 INFO L87 Difference]: Start difference. First operand 1037 states and 2004 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:51,293 INFO L93 Difference]: Finished difference Result 1876 states and 3631 transitions. [2022-03-15 20:26:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 20:26:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:51,295 INFO L225 Difference]: With dead ends: 1876 [2022-03-15 20:26:51,296 INFO L226 Difference]: Without dead ends: 1876 [2022-03-15 20:26:51,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-03-15 20:26:51,296 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 310 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:51,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 268 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:26:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-03-15 20:26:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1028. [2022-03-15 20:26:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1019 states have (on average 1.9489695780176644) internal successors, (1986), 1027 states have internal predecessors, (1986), 0 states have call successors, (0), 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:26:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1986 transitions. [2022-03-15 20:26:51,309 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1986 transitions. Word has length 26 [2022-03-15 20:26:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:51,309 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1986 transitions. [2022-03-15 20:26:51,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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:26:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1986 transitions. [2022-03-15 20:26:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:51,316 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:51,316 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:26:51,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-15 20:26:51,317 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash -844671906, now seen corresponding path program 16 times [2022-03-15 20:26:51,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:51,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220531081] [2022-03-15 20:26:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:51,560 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:26:51,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:51,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220531081] [2022-03-15 20:26:51,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220531081] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:51,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:51,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:51,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847692559] [2022-03-15 20:26:51,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:51,563 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:51,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2022-03-15 20:26:51,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:51,880 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [149526#(not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)), 149525#(or (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0))), 149520#(or (not (= (select |#valid| |ULTIMATE.start_main_~p~1#1.base|) 0)) (= |ULTIMATE.start_main_~p~1#1.base| 0)), 149522#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)) (not (= (select (select |#race| ~A~0.base) (+ 6 ~A~0.offset)) 0))), 149521#(or (= |ULTIMATE.start_main_#t~mem47#1.base| 0) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem47#1.base|) 0))), 149523#(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))), 149519#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (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))), 149524#(or (not (= (select (select |#race| ~A~0.base) (+ 5 ~A~0.offset)) 0)) (not (= |t_funThread1of1ForFork0_init_~p#1.base| |ULTIMATE.start_main_#t~mem47#1.base|)) (not (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 4)) 0)))] [2022-03-15 20:26:51,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 20:26:51,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 20:26:51,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:26:51,881 INFO L87 Difference]: Start difference. First operand 1028 states and 1986 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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:26:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:53,773 INFO L93 Difference]: Finished difference Result 1785 states and 3415 transitions. [2022-03-15 20:26:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 20:26:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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:26:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:53,776 INFO L225 Difference]: With dead ends: 1785 [2022-03-15 20:26:53,776 INFO L226 Difference]: Without dead ends: 1785 [2022-03-15 20:26:53,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 20:26:53,777 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 447 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:53,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 330 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 20:26:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-03-15 20:26:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1000. [2022-03-15 20:26:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 991 states have (on average 1.9475277497477295) internal successors, (1930), 999 states have internal predecessors, (1930), 0 states have call successors, (0), 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:26:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1930 transitions. [2022-03-15 20:26:53,789 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1930 transitions. Word has length 26 [2022-03-15 20:26:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:53,789 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1930 transitions. [2022-03-15 20:26:53,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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:26:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1930 transitions. [2022-03-15 20:26:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:26:53,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:53,790 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:26:53,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-15 20:26:53,790 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1382575760, now seen corresponding path program 17 times [2022-03-15 20:26:53,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:53,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884251233] [2022-03-15 20:26:53,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:54,029 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:26:54,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:54,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884251233] [2022-03-15 20:26:54,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884251233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:54,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:54,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:54,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859722217] [2022-03-15 20:26:54,030 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:54,033 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:54,038 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 36 transitions. [2022-03-15 20:26:54,038 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:54,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [153373#(and (not (= ~A~0.base |t_funThread1of1ForFork0_init_#in~p#1.base|)) (not (= |t_funThread1of1ForFork0_init_#in~p#1.base| (select (select |#memory_$Pointer$.base| ~A~0.base) (+ ~A~0.offset 4)))))] [2022-03-15 20:26:54,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:26:54,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:26:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:26:54,100 INFO L87 Difference]: Start difference. First operand 1000 states and 1930 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:26:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:55,169 INFO L93 Difference]: Finished difference Result 1629 states and 3149 transitions. [2022-03-15 20:26:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 20:26:55,169 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 26 [2022-03-15 20:26:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:55,171 INFO L225 Difference]: With dead ends: 1629 [2022-03-15 20:26:55,172 INFO L226 Difference]: Without dead ends: 1629 [2022-03-15 20:26:55,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2022-03-15 20:26:55,172 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 233 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:55,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 242 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-03-15 20:26:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 937. [2022-03-15 20:26:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 928 states have (on average 1.9439655172413792) internal successors, (1804), 936 states have internal predecessors, (1804), 0 states have call successors, (0), 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:26:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1804 transitions. [2022-03-15 20:26:55,184 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1804 transitions. Word has length 26 [2022-03-15 20:26:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:55,184 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1804 transitions. [2022-03-15 20:26:55,184 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:26:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1804 transitions. [2022-03-15 20:26:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 20:26:55,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:55,185 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] [2022-03-15 20:26:55,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-15 20:26:55,185 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 802540625, now seen corresponding path program 1 times [2022-03-15 20:26:55,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:55,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915325740] [2022-03-15 20:26:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:55,408 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:26:55,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:55,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915325740] [2022-03-15 20:26:55,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915325740] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:55,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:55,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:26:55,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377825879] [2022-03-15 20:26:55,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:55,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:55,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 87 transitions. [2022-03-15 20:26:55,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:55,441 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,442 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:55,458 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,459 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:55,466 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,467 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:55,469 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,469 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:55,477 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,477 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:55,479 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,479 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:55,487 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,488 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2022-03-15 20:26:55,491 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:26:55,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:26:55,672 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:55,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:26:55,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:26:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:26:55,673 INFO L87 Difference]: Start difference. First operand 937 states and 1804 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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:26:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:56,738 INFO L93 Difference]: Finished difference Result 1714 states and 3276 transitions. [2022-03-15 20:26:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:26:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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 27 [2022-03-15 20:26:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:56,740 INFO L225 Difference]: With dead ends: 1714 [2022-03-15 20:26:56,740 INFO L226 Difference]: Without dead ends: 1714 [2022-03-15 20:26:56,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:26:56,741 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 253 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:56,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 142 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 20:26:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-03-15 20:26:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 817. [2022-03-15 20:26:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 809 states have (on average 1.9394313967861558) internal successors, (1569), 816 states have internal predecessors, (1569), 0 states have call successors, (0), 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:26:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1569 transitions. [2022-03-15 20:26:56,753 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1569 transitions. Word has length 27 [2022-03-15 20:26:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:56,753 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1569 transitions. [2022-03-15 20:26:56,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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:26:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1569 transitions. [2022-03-15 20:26:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 20:26:56,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:56,754 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:26:56,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-15 20:26:56,754 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 35792316, now seen corresponding path program 1 times [2022-03-15 20:26:56,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:56,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105738924] [2022-03-15 20:26:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:26:56,839 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:26:56,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:26:56,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105738924] [2022-03-15 20:26:56,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105738924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:26:56,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:26:56,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:26:56,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779131631] [2022-03-15 20:26:56,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:26:56,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:26:56,848 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 31 transitions. [2022-03-15 20:26:56,848 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:26:56,849 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:26:56,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:26:56,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:26:56,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:26:56,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:26:56,849 INFO L87 Difference]: Start difference. First operand 817 states and 1569 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:26:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:26:57,100 INFO L93 Difference]: Finished difference Result 922 states and 1766 transitions. [2022-03-15 20:26:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:26:57,100 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:26:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:26:57,101 INFO L225 Difference]: With dead ends: 922 [2022-03-15 20:26:57,101 INFO L226 Difference]: Without dead ends: 922 [2022-03-15 20:26:57,101 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:26:57,102 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:26:57,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 48 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:26:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-03-15 20:26:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 862. [2022-03-15 20:26:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 854 states have (on average 1.9379391100702577) internal successors, (1655), 861 states have internal predecessors, (1655), 0 states have call successors, (0), 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:26:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1655 transitions. [2022-03-15 20:26:57,109 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1655 transitions. Word has length 31 [2022-03-15 20:26:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:26:57,110 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1655 transitions. [2022-03-15 20:26:57,110 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:26:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1655 transitions. [2022-03-15 20:26:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 20:26:57,110 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:26:57,110 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:26:57,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-15 20:26:57,111 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2022-03-15 20:26:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:26:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -893918060, now seen corresponding path program 1 times [2022-03-15 20:26:57,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:26:57,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961521002] [2022-03-15 20:26:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:26:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:26:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:26:57,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:26:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:26:57,203 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:26:57,203 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:26:57,204 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (29 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 30 remaining) [2022-03-15 20:26:57,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (17 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (16 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (15 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (14 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (13 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (8 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (7 of 30 remaining) [2022-03-15 20:26:57,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 30 remaining) [2022-03-15 20:26:57,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 30 remaining) [2022-03-15 20:26:57,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 20:26:57,208 INFO L732 BasicCegarLoop]: Path program histogram: [17, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:26:57,212 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:26:57,212 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:26:57,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:26:57 BasicIcfg [2022-03-15 20:26:57,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:26:57,276 INFO L158 Benchmark]: Toolchain (without parser) took 790719.95ms. Allocated memory was 168.8MB in the beginning and 272.6MB in the end (delta: 103.8MB). Free memory was 117.4MB in the beginning and 64.5MB in the end (delta: 52.9MB). Peak memory consumption was 157.8MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.13ms. Allocated memory is still 168.8MB. Free memory was 117.2MB in the beginning and 118.7MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.01ms. Allocated memory is still 168.8MB. Free memory was 118.7MB in the beginning and 114.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: Boogie Preprocessor took 29.02ms. Allocated memory is still 168.8MB. Free memory was 114.8MB in the beginning and 112.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: RCFGBuilder took 559.56ms. Allocated memory is still 168.8MB. Free memory was 112.2MB in the beginning and 88.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 INFO L158 Benchmark]: TraceAbstraction took 789532.94ms. Allocated memory was 168.8MB in the beginning and 272.6MB in the end (delta: 103.8MB). Free memory was 87.5MB in the beginning and 64.5MB in the end (delta: 23.0MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. [2022-03-15 20:26:57,276 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.12ms. Allocated memory is still 168.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 528.13ms. Allocated memory is still 168.8MB. Free memory was 117.2MB in the beginning and 118.7MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.01ms. Allocated memory is still 168.8MB. Free memory was 118.7MB in the beginning and 114.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.02ms. Allocated memory is still 168.8MB. Free memory was 114.8MB in the beginning and 112.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.56ms. Allocated memory is still 168.8MB. Free memory was 112.2MB in the beginning and 88.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 789532.94ms. Allocated memory was 168.8MB in the beginning and 272.6MB in the end (delta: 103.8MB). Free memory was 87.5MB in the beginning and 64.5MB in the end (delta: 23.0MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 711.4s, 254 PlacesBefore, 82 PlacesAfterwards, 250 TransitionsBefore, 78 TransitionsAfterwards, 4760 CoEnabledTransitionPairs, 10 FixpointIterations, 203 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 244 TotalNumberOfCompositions, 39660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8131, positive: 6834, positive conditional: 0, positive unconditional: 6834, negative: 1297, negative conditional: 0, negative unconditional: 1297, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1980, positive: 1898, positive conditional: 0, positive unconditional: 1898, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8131, positive: 4936, positive conditional: 0, positive unconditional: 4936, negative: 1215, negative conditional: 0, negative unconditional: 1215, unknown: 1980, unknown conditional: 0, unknown unconditional: 1980] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - 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: 1261]: Data race detected Data race detected The following path leads to a data race: [L1224-L1227] 0 struct s { int datum; struct s *next; } *A, *B; [L1232] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1233] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1247] 0 pthread_t t1; [L1248] 0 int *ip; [L1249] 0 struct s *sp; [L1250] 0 struct s *p = malloc(sizeof(struct s)); [L1251] CALL 0 init(p,9) [L1229] 0 p -> datum = x [L1230] 0 p -> next = ((void *)0) [L1251] RET 0 init(p,9) [L1252] 0 A = malloc(sizeof(struct s)) [L1253] 0 init(A,3) [L1253] CALL 0 init(A,3) [L1229] 0 p -> datum = x [L1230] 0 p -> next = ((void *)0) [L1253] RET 0 init(A,3) [L1254] EXPR 0 A->next [L1254] 0 A->next = p [L1255] 0 B = malloc(sizeof(struct s)) [L1256] 0 init(B,5) [L1256] CALL 0 init(B,5) [L1229] 0 p -> datum = x [L1230] 0 p -> next = ((void *)0) [L1256] RET 0 init(B,5) [L1257] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-4:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={11:0}] [L1235] 1 int *ip; [L1236] 1 struct s *t, *sp = __VERIFIER_nondet_pointer(); [L1237] 1 struct s *p = malloc(sizeof(struct s)); [L1238] CALL 1 init(p,7) [L1229] 1 p -> datum = x VAL [\old(x)=7, \old(x)=5, A={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-5:0}, p={-3:0}, p={-5:0}, x=7, x=5] [L1258] 0 ip = &p->datum [L1259] 0 sp = ((struct s *)((char *)(ip)-(unsigned long)(&((struct s *)0)->datum))) [L1261] EXPR 0 A->next VAL [A={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-4:0}, p={-4:0}, sp={-4:0}, t1={11:0}] [L1229] 1 p -> datum = x VAL [\old(x)=7, \old(x)=5, A={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-3:0}, p={-3:0}, p={-5:0}, p={-5:0}, p -> datum = x=119, x=5, x=7] [L1261] EXPR 0 A->next VAL [A={-2:0}, A->next={-4:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-4:0}, p={-4:0}, sp={-4:0}, t1={11:0}] [L1261] 0 p = A->next VAL [A={-2:0}, A->next={-4:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-4:0}, p={-4:0}, sp={-4:0}, t1={11:0}] [L1229] 1 p -> datum = x [L1230] 1 p -> next = ((void *)0) VAL [\old(x)=5, \old(x)=7, A={-2:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, p={-5:0}, p={-3:0}, p={-5:0}, p={-3:0}, x=7, x=5] [L1238] RET 1 init(p,7) [L1240] EXPR 1 A->next VAL [A={-2:0}, A->next={-4:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-5:0}, sp={112:122}] [L1240] 1 t = A->next VAL [A={-2:0}, A->next={-4:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-5:0}, sp={112:122}, t={-4:0}] [L1241] EXPR 1 A->next VAL [A={-2:0}, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-5:0}, sp={112:122}, t={-4:0}] [L1241] 1 A->next = sp VAL [A={-2:0}, A->next = sp=113, A_mutex={2:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={3:0}, p={-5:0}, sp={112:122}, t={-4:0}] [L1261] 0 p = A->next VAL [A={-2:0}, A->next={-4:0}, A_mutex={2:0}, B={-3:0}, B_mutex={3:0}, ip={-4:0}, p={-4:0}, sp={-4:0}, t1={11: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 [1229] * C: p -> datum = x [1229] * C: p -> datum = x [1229] * C: A = malloc(sizeof(struct s)) [1252] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] * C: p -> datum = x [1229] * C: B = malloc(sizeof(struct s)) [1255] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] * C: A->next = sp [1241] * C: p -> next = ((void *)0) [1230] * C: A->next = p [1254] and C: p = A->next [1261] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: 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: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: 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: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1256]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1261]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1257]: 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: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1242]: 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, 323 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 789.3s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 55.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 711.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11042 SdHoareTripleChecker+Valid, 44.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11042 mSDsluCounter, 8407 SdHoareTripleChecker+Invalid, 38.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14989 mSDsCounter, 3430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60214 IncrementalHoareTripleChecker+Invalid, 63644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3430 mSolverCounterUnsat, 1975 mSDtfsCounter, 60214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1595 GetRequests, 462 SyntacticMatches, 100 SemanticMatches, 1033 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6244 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=19, InterpolantAutomatonStates: 801, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 44 MinimizatonAttempts, 27435 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 19070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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:26:57,373 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...