/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/ldv-races/race-2_5b-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 20:08:29,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 20:08:29,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 20:08:29,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 20:08:29,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 20:08:29,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 20:08:29,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 20:08:29,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 20:08:29,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 20:08:29,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 20:08:29,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 20:08:29,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 20:08:29,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 20:08:29,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 20:08:29,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 20:08:29,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 20:08:29,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 20:08:29,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 20:08:29,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 20:08:29,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 20:08:29,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 20:08:29,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 20:08:29,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 20:08:29,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 20:08:29,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 20:08:29,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 20:08:29,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 20:08:29,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 20:08:29,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 20:08:29,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 20:08:29,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 20:08:29,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 20:08:29,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 20:08:29,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 20:08:29,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 20:08:29,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 20:08:29,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 20:08:29,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 20:08:29,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 20:08:29,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 20:08:29,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 20:08:29,868 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:08:29,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 20:08:29,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 20:08:29,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 20:08:29,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 20:08:29,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 20:08:29,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 20:08:29,893 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 20:08:29,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 20:08:29,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 20:08:29,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 20:08:29,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 20:08:29,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 20:08:29,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 20:08:29,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 20:08:29,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:08:29,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 20:08:29,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 20:08:29,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 20:08:29,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 20:08:29,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 20:08:29,896 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 20:08:29,896 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 20:08:29,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 20:08:29,896 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:08:30,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 20:08:30,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 20:08:30,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 20:08:30,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 20:08:30,091 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 20:08:30,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5b-container_of.i [2022-03-15 20:08:30,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1c9530c/7530d438fbbd4b51bcffae48ae5c3d6b/FLAG6c8ae432e [2022-03-15 20:08:30,617 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 20:08:30,618 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5b-container_of.i [2022-03-15 20:08:30,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1c9530c/7530d438fbbd4b51bcffae48ae5c3d6b/FLAG6c8ae432e [2022-03-15 20:08:31,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1c9530c/7530d438fbbd4b51bcffae48ae5c3d6b [2022-03-15 20:08:31,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 20:08:31,125 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 20:08:31,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 20:08:31,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 20:08:31,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 20:08:31,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21874bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31, skipping insertion in model container [2022-03-15 20:08:31,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 20:08:31,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 20:08:31,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5b-container_of.i[76077,76090] [2022-03-15 20:08:31,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:08:31,649 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 20:08:31,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5b-container_of.i[76077,76090] [2022-03-15 20:08:31,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 20:08:31,751 INFO L208 MainTranslator]: Completed translation [2022-03-15 20:08:31,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31 WrapperNode [2022-03-15 20:08:31,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 20:08:31,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 20:08:31,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 20:08:31,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 20:08:31,758 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:08:31" (1/1) ... [2022-03-15 20:08:31,786 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:08:31" (1/1) ... [2022-03-15 20:08:31,835 INFO L137 Inliner]: procedures = 482, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 217 [2022-03-15 20:08:31,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 20:08:31,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 20:08:31,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 20:08:31,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 20:08:31,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 20:08:31,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 20:08:31,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 20:08:31,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 20:08:31,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (1/1) ... [2022-03-15 20:08:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 20:08:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 20:08:31,924 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:08:31,930 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:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 20:08:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 20:08:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-03-15 20:08:31,965 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-03-15 20:08:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 20:08:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 20:08:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 20:08:31,967 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:08:32,254 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 20:08:32,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 20:08:32,587 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 20:08:32,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 20:08:32,593 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 20:08:32,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:08:32 BoogieIcfgContainer [2022-03-15 20:08:32,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 20:08:32,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 20:08:32,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 20:08:32,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 20:08:32,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 08:08:31" (1/3) ... [2022-03-15 20:08:32,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d90aaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:08:32, skipping insertion in model container [2022-03-15 20:08:32,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 08:08:31" (2/3) ... [2022-03-15 20:08:32,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d90aaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 08:08:32, skipping insertion in model container [2022-03-15 20:08:32,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 08:08:32" (3/3) ... [2022-03-15 20:08:32,600 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_5b-container_of.i [2022-03-15 20:08:32,603 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 20:08:32,603 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 20:08:32,603 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-03-15 20:08:32,603 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 20:08:32,637 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,638 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,639 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,640 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,641 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,642 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,643 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,644 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,645 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,646 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,647 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,648 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,649 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,650 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,651 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,652 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,653 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,654 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,655 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,656 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,657 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,658 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,659 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,659 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,659 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,661 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,662 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,662 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,666 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,666 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,667 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,667 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,667 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,672 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,673 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,674 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,675 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,676 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,677 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,678 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,678 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,679 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,680 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,681 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,682 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,682 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,682 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,682 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,683 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,684 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,684 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,686 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,686 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,689 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,690 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,691 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,693 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,693 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,693 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,693 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,694 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 20:08:32,696 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 20:08:32,724 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 20:08:32,730 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:08:32,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-15 20:08:32,742 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 20:08:32,747 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 331 transitions, 678 flow [2022-03-15 20:08:32,749 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 331 transitions, 678 flow [2022-03-15 20:08:32,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 329 places, 331 transitions, 678 flow [2022-03-15 20:08:32,878 INFO L129 PetriNetUnfolder]: 10/408 cut-off events. [2022-03-15 20:08:32,879 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 20:08:32,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 408 events. 10/408 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 814 event pairs, 0 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 218. Up to 4 conditions per place. [2022-03-15 20:08:32,895 INFO L116 LiptonReduction]: Number of co-enabled transitions 19368 [2022-03-15 20:09:11,323 WARN L228 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 180 DAG size of output: 178 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-03-15 20:09:32,208 INFO L131 LiptonReduction]: Checked pairs total: 151343 [2022-03-15 20:09:32,208 INFO L133 LiptonReduction]: Total number of compositions: 267 [2022-03-15 20:09:32,215 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 137 transitions, 290 flow [2022-03-15 20:09:32,626 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22314 states, 22173 states have (on average 2.9172416903441123) internal successors, (64684), 22313 states have internal predecessors, (64684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 22314 states, 22173 states have (on average 2.9172416903441123) internal successors, (64684), 22313 states have internal predecessors, (64684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-03-15 20:09:32,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:32,677 INFO L514 BasicCegarLoop]: trace histogram [1] [2022-03-15 20:09:32,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1010, now seen corresponding path program 1 times [2022-03-15 20:09:32,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:32,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715844205] [2022-03-15 20:09:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:32,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:32,852 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:09:32,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:32,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715844205] [2022-03-15 20:09:32,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715844205] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:32,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:32,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-03-15 20:09:32,854 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848500131] [2022-03-15 20:09:32,854 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:32,856 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:32,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2022-03-15 20:09:32,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:32,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:32,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 20:09:32,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 20:09:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 20:09:33,000 INFO L87 Difference]: Start difference. First operand has 22314 states, 22173 states have (on average 2.9172416903441123) internal successors, (64684), 22313 states have internal predecessors, (64684), 0 states have call successors, (0), 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:09:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:33,371 INFO L93 Difference]: Finished difference Result 22286 states and 63456 transitions. [2022-03-15 20:09:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 20:09:33,374 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:09:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:33,549 INFO L225 Difference]: With dead ends: 22286 [2022-03-15 20:09:33,549 INFO L226 Difference]: Without dead ends: 22281 [2022-03-15 20:09:33,552 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:09:33,555 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:33,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:09:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22281 states. [2022-03-15 20:09:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22281 to 22281. [2022-03-15 20:09:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22281 states, 22146 states have (on average 2.864761130678226) internal successors, (63443), 22280 states have internal predecessors, (63443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22281 states to 22281 states and 63443 transitions. [2022-03-15 20:09:34,319 INFO L78 Accepts]: Start accepts. Automaton has 22281 states and 63443 transitions. Word has length 1 [2022-03-15 20:09:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:34,319 INFO L470 AbstractCegarLoop]: Abstraction has 22281 states and 63443 transitions. [2022-03-15 20:09:34,320 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:09:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22281 states and 63443 transitions. [2022-03-15 20:09:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:09:34,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:34,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:34,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 20:09:34,334 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -875102561, now seen corresponding path program 1 times [2022-03-15 20:09:34,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:34,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419940301] [2022-03-15 20:09:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:34,450 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:09:34,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:34,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419940301] [2022-03-15 20:09:34,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419940301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:34,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:34,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 20:09:34,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880860923] [2022-03-15 20:09:34,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:34,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:34,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 20:09:34,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:34,452 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:34,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:09:34,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:09:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:09:34,454 INFO L87 Difference]: Start difference. First operand 22281 states and 63443 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:34,766 INFO L93 Difference]: Finished difference Result 22275 states and 63437 transitions. [2022-03-15 20:09:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:09:34,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 20:09:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:34,937 INFO L225 Difference]: With dead ends: 22275 [2022-03-15 20:09:34,937 INFO L226 Difference]: Without dead ends: 22275 [2022-03-15 20:09:34,937 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:09:34,951 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:34,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 20:09:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22275 states. [2022-03-15 20:09:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22275 to 22275. [2022-03-15 20:09:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22275 states, 22141 states have (on average 2.865137076012827) internal successors, (63437), 22274 states have internal predecessors, (63437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22275 states to 22275 states and 63437 transitions. [2022-03-15 20:09:35,549 INFO L78 Accepts]: Start accepts. Automaton has 22275 states and 63437 transitions. Word has length 7 [2022-03-15 20:09:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:35,549 INFO L470 AbstractCegarLoop]: Abstraction has 22275 states and 63437 transitions. [2022-03-15 20:09:35,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 22275 states and 63437 transitions. [2022-03-15 20:09:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 20:09:35,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:35,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:35,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 20:09:35,550 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:35,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1672735373, now seen corresponding path program 1 times [2022-03-15 20:09:35,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:35,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799942632] [2022-03-15 20:09:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:35,759 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:09:35,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:35,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799942632] [2022-03-15 20:09:35,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799942632] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:35,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:35,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:35,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297036227] [2022-03-15 20:09:35,760 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:35,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:35,761 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 20:09:35,761 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:35,762 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:35,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:35,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:35,763 INFO L87 Difference]: Start difference. First operand 22275 states and 63437 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:36,493 INFO L93 Difference]: Finished difference Result 25100 states and 71674 transitions. [2022-03-15 20:09:36,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 20:09:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:36,684 INFO L225 Difference]: With dead ends: 25100 [2022-03-15 20:09:36,685 INFO L226 Difference]: Without dead ends: 25100 [2022-03-15 20:09:36,685 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:09:36,685 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:36,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 106 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:09:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25100 states. [2022-03-15 20:09:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25100 to 24533. [2022-03-15 20:09:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24533 states, 24400 states have (on average 2.869713114754098) internal successors, (70021), 24532 states have internal predecessors, (70021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24533 states to 24533 states and 70021 transitions. [2022-03-15 20:09:37,509 INFO L78 Accepts]: Start accepts. Automaton has 24533 states and 70021 transitions. Word has length 7 [2022-03-15 20:09:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:37,509 INFO L470 AbstractCegarLoop]: Abstraction has 24533 states and 70021 transitions. [2022-03-15 20:09:37,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 24533 states and 70021 transitions. [2022-03-15 20:09:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 20:09:37,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:37,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:37,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 20:09:37,512 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash 328674814, now seen corresponding path program 1 times [2022-03-15 20:09:37,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:37,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119167904] [2022-03-15 20:09:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:37,627 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:09:37,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:37,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119167904] [2022-03-15 20:09:37,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119167904] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:37,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:37,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:37,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83108128] [2022-03-15 20:09:37,628 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:37,629 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:37,630 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 20:09:37,630 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:37,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:37,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:37,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:37,632 INFO L87 Difference]: Start difference. First operand 24533 states and 70021 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:09:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:38,484 INFO L93 Difference]: Finished difference Result 28020 states and 80225 transitions. [2022-03-15 20:09:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:38,485 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:09:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:38,578 INFO L225 Difference]: With dead ends: 28020 [2022-03-15 20:09:38,578 INFO L226 Difference]: Without dead ends: 28020 [2022-03-15 20:09:38,580 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:09:38,581 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 116 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:38,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 106 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:09:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28020 states. [2022-03-15 20:09:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28020 to 28020. [2022-03-15 20:09:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28020 states, 27887 states have (on average 2.876788467744827) internal successors, (80225), 28019 states have internal predecessors, (80225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28020 states to 28020 states and 80225 transitions. [2022-03-15 20:09:39,285 INFO L78 Accepts]: Start accepts. Automaton has 28020 states and 80225 transitions. Word has length 9 [2022-03-15 20:09:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:39,285 INFO L470 AbstractCegarLoop]: Abstraction has 28020 states and 80225 transitions. [2022-03-15 20:09:39,285 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:09:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 28020 states and 80225 transitions. [2022-03-15 20:09:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:09:39,287 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:39,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:39,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 20:09:39,287 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1231144440, now seen corresponding path program 1 times [2022-03-15 20:09:39,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:39,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680733322] [2022-03-15 20:09:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:39,370 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:09:39,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:39,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680733322] [2022-03-15 20:09:39,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680733322] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:39,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:39,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:39,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1218771821] [2022-03-15 20:09:39,371 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:39,372 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:39,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:09:39,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:39,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:39,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:39,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:39,374 INFO L87 Difference]: Start difference. First operand 28020 states and 80225 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:09:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:40,771 INFO L93 Difference]: Finished difference Result 32801 states and 94050 transitions. [2022-03-15 20:09:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:40,772 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:09:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:40,854 INFO L225 Difference]: With dead ends: 32801 [2022-03-15 20:09:40,854 INFO L226 Difference]: Without dead ends: 32801 [2022-03-15 20:09:40,854 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:09:40,855 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 177 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:40,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 119 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:09:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32801 states. [2022-03-15 20:09:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32801 to 31652. [2022-03-15 20:09:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31652 states, 31519 states have (on average 2.8780418160474635) internal successors, (90713), 31651 states have internal predecessors, (90713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31652 states to 31652 states and 90713 transitions. [2022-03-15 20:09:41,684 INFO L78 Accepts]: Start accepts. Automaton has 31652 states and 90713 transitions. Word has length 11 [2022-03-15 20:09:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:41,685 INFO L470 AbstractCegarLoop]: Abstraction has 31652 states and 90713 transitions. [2022-03-15 20:09:41,685 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:09:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 31652 states and 90713 transitions. [2022-03-15 20:09:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 20:09:41,687 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:41,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:41,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 20:09:41,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1918898765, now seen corresponding path program 1 times [2022-03-15 20:09:41,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:41,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045777840] [2022-03-15 20:09:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:41,778 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:09:41,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:41,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045777840] [2022-03-15 20:09:41,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045777840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:41,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:41,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:41,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [455421506] [2022-03-15 20:09:41,779 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:41,780 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:41,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 20:09:41,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:41,781 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:41,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:41,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:41,782 INFO L87 Difference]: Start difference. First operand 31652 states and 90713 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:09:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:42,563 INFO L93 Difference]: Finished difference Result 34740 states and 98918 transitions. [2022-03-15 20:09:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:42,565 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:09:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:42,662 INFO L225 Difference]: With dead ends: 34740 [2022-03-15 20:09:42,663 INFO L226 Difference]: Without dead ends: 34740 [2022-03-15 20:09:42,663 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:09:42,663 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 104 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:42,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 103 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:09:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34740 states. [2022-03-15 20:09:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34740 to 33904. [2022-03-15 20:09:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33904 states, 33771 states have (on average 2.8804891771046166) internal successors, (97277), 33903 states have internal predecessors, (97277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33904 states to 33904 states and 97277 transitions. [2022-03-15 20:09:43,488 INFO L78 Accepts]: Start accepts. Automaton has 33904 states and 97277 transitions. Word has length 11 [2022-03-15 20:09:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:43,489 INFO L470 AbstractCegarLoop]: Abstraction has 33904 states and 97277 transitions. [2022-03-15 20:09:43,489 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:09:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 33904 states and 97277 transitions. [2022-03-15 20:09:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 20:09:43,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:43,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:43,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 20:09:43,491 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2027194638, now seen corresponding path program 1 times [2022-03-15 20:09:43,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:43,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052314176] [2022-03-15 20:09:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:43,580 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:09:43,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:43,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052314176] [2022-03-15 20:09:43,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052314176] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:43,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:43,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:43,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463590109] [2022-03-15 20:09:43,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:43,582 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:43,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 20:09:43,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:43,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:43,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:43,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:43,584 INFO L87 Difference]: Start difference. First operand 33904 states and 97277 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:44,519 INFO L93 Difference]: Finished difference Result 36155 states and 103840 transitions. [2022-03-15 20:09:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-03-15 20:09:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:44,610 INFO L225 Difference]: With dead ends: 36155 [2022-03-15 20:09:44,611 INFO L226 Difference]: Without dead ends: 36155 [2022-03-15 20:09:44,611 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:09:44,612 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 88 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:44,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 110 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 20:09:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36155 states. [2022-03-15 20:09:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36155 to 36155. [2022-03-15 20:09:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36155 states, 36023 states have (on average 2.882602781556228) internal successors, (103840), 36154 states have internal predecessors, (103840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36155 states to 36155 states and 103840 transitions. [2022-03-15 20:09:45,349 INFO L78 Accepts]: Start accepts. Automaton has 36155 states and 103840 transitions. Word has length 13 [2022-03-15 20:09:45,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:45,349 INFO L470 AbstractCegarLoop]: Abstraction has 36155 states and 103840 transitions. [2022-03-15 20:09:45,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36155 states and 103840 transitions. [2022-03-15 20:09:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:45,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:45,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:45,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 20:09:45,352 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash -497124816, now seen corresponding path program 1 times [2022-03-15 20:09:45,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:45,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137806227] [2022-03-15 20:09:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:45,671 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:09:45,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:45,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137806227] [2022-03-15 20:09:45,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137806227] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:45,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:45,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:45,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526689868] [2022-03-15 20:09:45,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:45,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:45,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2022-03-15 20:09:45,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:45,778 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [644018#(and (or (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0))) (or (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0))) (or (= (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24)) 0) (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0)))), 644019#(and (or (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0)) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)) (or (= (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24)) 0) (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0))) (or (= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| 24) (not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0))))] [2022-03-15 20:09:45,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 20:09:45,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 20:09:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 20:09:45,779 INFO L87 Difference]: Start difference. First operand 36155 states and 103840 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:46,393 INFO L93 Difference]: Finished difference Result 37378 states and 105059 transitions. [2022-03-15 20:09:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 20:09:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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:09:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:46,556 INFO L225 Difference]: With dead ends: 37378 [2022-03-15 20:09:46,557 INFO L226 Difference]: Without dead ends: 37378 [2022-03-15 20:09:46,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:09:46,557 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 579 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:46,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 440 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:09:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37378 states. [2022-03-15 20:09:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37378 to 36155. [2022-03-15 20:09:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36155 states, 36002 states have (on average 2.8517026831842673) internal successors, (102667), 36154 states have internal predecessors, (102667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36155 states to 36155 states and 102667 transitions. [2022-03-15 20:09:47,412 INFO L78 Accepts]: Start accepts. Automaton has 36155 states and 102667 transitions. Word has length 14 [2022-03-15 20:09:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:47,412 INFO L470 AbstractCegarLoop]: Abstraction has 36155 states and 102667 transitions. [2022-03-15 20:09:47,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36155 states and 102667 transitions. [2022-03-15 20:09:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:47,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:47,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:47,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 20:09:47,414 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -989996795, now seen corresponding path program 1 times [2022-03-15 20:09:47,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:47,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783385271] [2022-03-15 20:09:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:47,585 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:09:47,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:47,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783385271] [2022-03-15 20:09:47,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783385271] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:47,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:47,585 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:09:47,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074815541] [2022-03-15 20:09:47,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:47,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:47,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2022-03-15 20:09:47,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:47,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:47,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:47,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:47,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:47,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:48,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [753724#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 753727#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 753728#(not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)), 753726#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 753725#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:09:48,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:09:48,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:09:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:09:48,008 INFO L87 Difference]: Start difference. First operand 36155 states and 102667 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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:09:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:50,098 INFO L93 Difference]: Finished difference Result 38942 states and 110043 transitions. [2022-03-15 20:09:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:09:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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 14 [2022-03-15 20:09:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:50,194 INFO L225 Difference]: With dead ends: 38942 [2022-03-15 20:09:50,194 INFO L226 Difference]: Without dead ends: 38942 [2022-03-15 20:09:50,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:09:50,197 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 646 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:50,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 200 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:09:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38942 states. [2022-03-15 20:09:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38942 to 36167. [2022-03-15 20:09:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36167 states, 36017 states have (on average 2.8543465585695644) internal successors, (102805), 36166 states have internal predecessors, (102805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36167 states to 36167 states and 102805 transitions. [2022-03-15 20:09:51,032 INFO L78 Accepts]: Start accepts. Automaton has 36167 states and 102805 transitions. Word has length 14 [2022-03-15 20:09:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:51,032 INFO L470 AbstractCegarLoop]: Abstraction has 36167 states and 102805 transitions. [2022-03-15 20:09:51,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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:09:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36167 states and 102805 transitions. [2022-03-15 20:09:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:51,034 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:51,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:51,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 20:09:51,034 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1633801247, now seen corresponding path program 1 times [2022-03-15 20:09:51,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:51,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388881497] [2022-03-15 20:09:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:51,308 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:09:51,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:51,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388881497] [2022-03-15 20:09:51,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388881497] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:51,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:51,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:09:51,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222365138] [2022-03-15 20:09:51,309 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:51,310 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:51,312 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 22 transitions. [2022-03-15 20:09:51,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:51,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:51,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:51,406 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [865037#(not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|))] [2022-03-15 20:09:51,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:09:51,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:09:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:09:51,406 INFO L87 Difference]: Start difference. First operand 36167 states and 102805 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:53,082 INFO L93 Difference]: Finished difference Result 36929 states and 104936 transitions. [2022-03-15 20:09:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:09:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 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:09:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:53,183 INFO L225 Difference]: With dead ends: 36929 [2022-03-15 20:09:53,183 INFO L226 Difference]: Without dead ends: 36929 [2022-03-15 20:09:53,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:09:53,184 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 772 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:53,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 171 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1834 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:09:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36929 states. [2022-03-15 20:09:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36929 to 36092. [2022-03-15 20:09:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36092 states, 35943 states have (on average 2.855076092702334) internal successors, (102620), 36091 states have internal predecessors, (102620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 102620 transitions. [2022-03-15 20:09:54,064 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 102620 transitions. Word has length 14 [2022-03-15 20:09:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:54,064 INFO L470 AbstractCegarLoop]: Abstraction has 36092 states and 102620 transitions. [2022-03-15 20:09:54,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 102620 transitions. [2022-03-15 20:09:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:54,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:54,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:54,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 20:09:54,066 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1284127257, now seen corresponding path program 1 times [2022-03-15 20:09:54,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:54,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547134324] [2022-03-15 20:09:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:54,110 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:09:54,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:54,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547134324] [2022-03-15 20:09:54,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547134324] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:54,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:54,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 20:09:54,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1521429894] [2022-03-15 20:09:54,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:54,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:54,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2022-03-15 20:09:54,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:54,146 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:54,147 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:54,152 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:54,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:54,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:54,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 20:09:54,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 20:09:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 20:09:54,174 INFO L87 Difference]: Start difference. First operand 36092 states and 102620 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:54,378 INFO L93 Difference]: Finished difference Result 10119 states and 27561 transitions. [2022-03-15 20:09:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 20:09:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:09:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:54,397 INFO L225 Difference]: With dead ends: 10119 [2022-03-15 20:09:54,397 INFO L226 Difference]: Without dead ends: 10119 [2022-03-15 20:09:54,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 1 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:09:54,398 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 45 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:54,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 206 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:09:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10119 states. [2022-03-15 20:09:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10119 to 10119. [2022-03-15 20:09:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10119 states, 10064 states have (on average 2.738573131955485) internal successors, (27561), 10118 states have internal predecessors, (27561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 27561 transitions. [2022-03-15 20:09:54,532 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 27561 transitions. Word has length 14 [2022-03-15 20:09:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:54,532 INFO L470 AbstractCegarLoop]: Abstraction has 10119 states and 27561 transitions. [2022-03-15 20:09:54,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 27561 transitions. [2022-03-15 20:09:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:54,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:54,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:54,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 20:09:54,533 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -565126442, now seen corresponding path program 2 times [2022-03-15 20:09:54,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:54,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170937869] [2022-03-15 20:09:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:54,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:54,636 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:09:54,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:54,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170937869] [2022-03-15 20:09:54,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170937869] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:54,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:54,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:54,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381755522] [2022-03-15 20:09:54,637 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:54,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:54,640 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2022-03-15 20:09:54,640 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:54,685 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:54,685 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:54,687 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:54,688 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:54,689 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1004539#(not (= (select (select |#pthreadsMutex| |my_callbackThread1of1ForFork0_#in~arg.base|) (+ |my_callbackThread1of1ForFork0_#in~arg.offset| (- 24))) 0))] [2022-03-15 20:09:54,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 20:09:54,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 20:09:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-15 20:09:54,690 INFO L87 Difference]: Start difference. First operand 10119 states and 27561 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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:09:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:54,919 INFO L93 Difference]: Finished difference Result 2207 states and 4222 transitions. [2022-03-15 20:09:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 20:09:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 14 [2022-03-15 20:09:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:54,921 INFO L225 Difference]: With dead ends: 2207 [2022-03-15 20:09:54,922 INFO L226 Difference]: Without dead ends: 2207 [2022-03-15 20:09:54,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:09:54,922 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 400 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:54,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 294 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:09:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-03-15 20:09:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2186. [2022-03-15 20:09:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 2145 states have (on average 1.958974358974359) internal successors, (4202), 2185 states have internal predecessors, (4202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 4202 transitions. [2022-03-15 20:09:55,064 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 4202 transitions. Word has length 14 [2022-03-15 20:09:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:55,064 INFO L470 AbstractCegarLoop]: Abstraction has 2186 states and 4202 transitions. [2022-03-15 20:09:55,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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:09:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 4202 transitions. [2022-03-15 20:09:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:55,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:55,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:55,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 20:09:55,065 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -859007205, now seen corresponding path program 1 times [2022-03-15 20:09:55,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:55,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584182640] [2022-03-15 20:09:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:55,179 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:09:55,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:55,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584182640] [2022-03-15 20:09:55,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584182640] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:55,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:55,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:09:55,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215613311] [2022-03-15 20:09:55,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:55,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:55,182 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 18 transitions. [2022-03-15 20:09:55,182 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:55,188 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:55,188 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:55,191 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:55,191 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:55,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:55,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1011137#(not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|))] [2022-03-15 20:09:55,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:09:55,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:09:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:09:55,209 INFO L87 Difference]: Start difference. First operand 2186 states and 4202 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:56,354 INFO L93 Difference]: Finished difference Result 2573 states and 4904 transitions. [2022-03-15 20:09:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:09:56,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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:09:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:56,357 INFO L225 Difference]: With dead ends: 2573 [2022-03-15 20:09:56,357 INFO L226 Difference]: Without dead ends: 2573 [2022-03-15 20:09:56,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-03-15 20:09:56,358 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 558 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:56,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 219 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:09:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2022-03-15 20:09:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2120. [2022-03-15 20:09:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2082 states have (on average 1.9586935638808838) internal successors, (4078), 2119 states have internal predecessors, (4078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 4078 transitions. [2022-03-15 20:09:56,379 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 4078 transitions. Word has length 14 [2022-03-15 20:09:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:56,380 INFO L470 AbstractCegarLoop]: Abstraction has 2120 states and 4078 transitions. [2022-03-15 20:09:56,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 4078 transitions. [2022-03-15 20:09:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 20:09:56,380 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:56,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:56,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-15 20:09:56,380 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -298363805, now seen corresponding path program 1 times [2022-03-15 20:09:56,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:56,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444818976] [2022-03-15 20:09:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:56,496 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:09:56,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:56,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444818976] [2022-03-15 20:09:56,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444818976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:56,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:56,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:09:56,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1964259860] [2022-03-15 20:09:56,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:56,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:56,499 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 22 transitions. [2022-03-15 20:09:56,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:56,504 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:56,504 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:56,507 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:09:56,507 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:09:56,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:09:56,554 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1017981#(not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|))] [2022-03-15 20:09:56,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:09:56,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:09:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:09:56,555 INFO L87 Difference]: Start difference. First operand 2120 states and 4078 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:57,619 INFO L93 Difference]: Finished difference Result 2158 states and 4132 transitions. [2022-03-15 20:09:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:09:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 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:09:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:57,622 INFO L225 Difference]: With dead ends: 2158 [2022-03-15 20:09:57,622 INFO L226 Difference]: Without dead ends: 2158 [2022-03-15 20:09:57,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:09:57,622 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 541 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:57,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 203 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 20:09:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-03-15 20:09:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2035. [2022-03-15 20:09:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1999 states have (on average 1.9574787393696849) internal successors, (3913), 2034 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3913 transitions. [2022-03-15 20:09:57,643 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3913 transitions. Word has length 14 [2022-03-15 20:09:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:57,643 INFO L470 AbstractCegarLoop]: Abstraction has 2035 states and 3913 transitions. [2022-03-15 20:09:57,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3913 transitions. [2022-03-15 20:09:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 20:09:57,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:57,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:57,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-15 20:09:57,644 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:57,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1404458343, now seen corresponding path program 1 times [2022-03-15 20:09:57,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:57,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13479583] [2022-03-15 20:09:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:57,713 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:09:57,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:57,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13479583] [2022-03-15 20:09:57,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13479583] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:57,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:57,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:57,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291071430] [2022-03-15 20:09:57,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:57,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:57,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2022-03-15 20:09:57,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:57,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:57,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:57,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:57,717 INFO L87 Difference]: Start difference. First operand 2035 states and 3913 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:09:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:58,162 INFO L93 Difference]: Finished difference Result 2012 states and 3869 transitions. [2022-03-15 20:09:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:58,163 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:09:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:58,166 INFO L225 Difference]: With dead ends: 2012 [2022-03-15 20:09:58,166 INFO L226 Difference]: Without dead ends: 2012 [2022-03-15 20:09:58,166 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:09:58,167 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 26 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:58,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:09:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-03-15 20:09:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2012. [2022-03-15 20:09:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1979 states have (on average 1.9550277918140475) internal successors, (3869), 2011 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3869 transitions. [2022-03-15 20:09:58,188 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3869 transitions. Word has length 15 [2022-03-15 20:09:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:58,188 INFO L470 AbstractCegarLoop]: Abstraction has 2012 states and 3869 transitions. [2022-03-15 20:09:58,188 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:09:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3869 transitions. [2022-03-15 20:09:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 20:09:58,189 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:58,189 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:09:58,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-15 20:09:58,191 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 128566170, now seen corresponding path program 1 times [2022-03-15 20:09:58,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:58,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189396827] [2022-03-15 20:09:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:58,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:58,274 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:09:58,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:58,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189396827] [2022-03-15 20:09:58,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189396827] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:58,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:58,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:58,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401902190] [2022-03-15 20:09:58,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:58,277 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:58,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2022-03-15 20:09:58,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:58,279 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:58,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:58,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:58,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:58,280 INFO L87 Difference]: Start difference. First operand 2012 states and 3869 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:09:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:58,966 INFO L93 Difference]: Finished difference Result 2192 states and 4224 transitions. [2022-03-15 20:09:58,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:58,967 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:09:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:58,970 INFO L225 Difference]: With dead ends: 2192 [2022-03-15 20:09:58,970 INFO L226 Difference]: Without dead ends: 2192 [2022-03-15 20:09:58,970 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:09:58,970 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 88 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:58,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 96 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 20:09:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-03-15 20:09:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2124. [2022-03-15 20:09:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2093 states have (on average 1.954132823698041) internal successors, (4090), 2123 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 4090 transitions. [2022-03-15 20:09:58,996 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 4090 transitions. Word has length 17 [2022-03-15 20:09:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:58,997 INFO L470 AbstractCegarLoop]: Abstraction has 2124 states and 4090 transitions. [2022-03-15 20:09:58,997 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:09:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 4090 transitions. [2022-03-15 20:09:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 20:09:58,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:58,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:09:58,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-15 20:09:58,998 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2012695201, now seen corresponding path program 1 times [2022-03-15 20:09:58,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:58,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360406781] [2022-03-15 20:09:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:59,068 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:09:59,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:59,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360406781] [2022-03-15 20:09:59,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360406781] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:59,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:59,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:59,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363260458] [2022-03-15 20:09:59,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:59,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:59,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2022-03-15 20:09:59,072 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:59,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:59,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:59,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:59,073 INFO L87 Difference]: Start difference. First operand 2124 states and 4090 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:59,271 INFO L93 Difference]: Finished difference Result 2123 states and 4089 transitions. [2022-03-15 20:09:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-03-15 20:09:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:59,275 INFO L225 Difference]: With dead ends: 2123 [2022-03-15 20:09:59,275 INFO L226 Difference]: Without dead ends: 2123 [2022-03-15 20:09:59,275 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:09:59,276 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:59,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:09:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-03-15 20:09:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2022-03-15 20:09:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2093 states have (on average 1.9536550406115623) internal successors, (4089), 2122 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 4089 transitions. [2022-03-15 20:09:59,298 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 4089 transitions. Word has length 19 [2022-03-15 20:09:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:59,298 INFO L470 AbstractCegarLoop]: Abstraction has 2123 states and 4089 transitions. [2022-03-15 20:09:59,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 4089 transitions. [2022-03-15 20:09:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 20:09:59,299 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:59,299 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] [2022-03-15 20:09:59,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 20:09:59,299 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:59,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1282244362, now seen corresponding path program 1 times [2022-03-15 20:09:59,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:59,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089309766] [2022-03-15 20:09:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:59,366 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:09:59,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:59,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089309766] [2022-03-15 20:09:59,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089309766] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:59,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:59,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:59,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998879571] [2022-03-15 20:09:59,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:59,369 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:59,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2022-03-15 20:09:59,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:59,371 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:59,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:59,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:59,372 INFO L87 Difference]: Start difference. First operand 2123 states and 4089 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:09:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:09:59,727 INFO L93 Difference]: Finished difference Result 2187 states and 4207 transitions. [2022-03-15 20:09:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:09:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 21 [2022-03-15 20:09:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:09:59,731 INFO L225 Difference]: With dead ends: 2187 [2022-03-15 20:09:59,731 INFO L226 Difference]: Without dead ends: 2187 [2022-03-15 20:09:59,732 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:09:59,732 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:09:59,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 86 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 20:09:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2022-03-15 20:09:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2170. [2022-03-15 20:09:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2140 states have (on average 1.9509345794392523) internal successors, (4175), 2169 states have internal predecessors, (4175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:09:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 4175 transitions. [2022-03-15 20:09:59,751 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 4175 transitions. Word has length 21 [2022-03-15 20:09:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:09:59,752 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 4175 transitions. [2022-03-15 20:09:59,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:09:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 4175 transitions. [2022-03-15 20:09:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 20:09:59,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:09:59,752 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] [2022-03-15 20:09:59,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 20:09:59,753 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:09:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:09:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 551084693, now seen corresponding path program 1 times [2022-03-15 20:09:59,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:09:59,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820954889] [2022-03-15 20:09:59,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:09:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:09:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:09:59,823 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:09:59,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:09:59,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820954889] [2022-03-15 20:09:59,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820954889] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:09:59,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:09:59,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:09:59,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27468563] [2022-03-15 20:09:59,823 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:09:59,825 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:09:59,829 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2022-03-15 20:09:59,829 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:09:59,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:09:59,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:09:59,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:09:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:09:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:09:59,830 INFO L87 Difference]: Start difference. First operand 2170 states and 4175 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:00,214 INFO L93 Difference]: Finished difference Result 2421 states and 4667 transitions. [2022-03-15 20:10:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 20:10:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:00,217 INFO L225 Difference]: With dead ends: 2421 [2022-03-15 20:10:00,218 INFO L226 Difference]: Without dead ends: 2421 [2022-03-15 20:10:00,218 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:10:00,218 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 88 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:00,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 90 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:10:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2022-03-15 20:10:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2367. [2022-03-15 20:10:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2337 states have (on average 1.9516474112109543) internal successors, (4561), 2366 states have internal predecessors, (4561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 4561 transitions. [2022-03-15 20:10:00,240 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 4561 transitions. Word has length 23 [2022-03-15 20:10:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:00,240 INFO L470 AbstractCegarLoop]: Abstraction has 2367 states and 4561 transitions. [2022-03-15 20:10:00,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 4561 transitions. [2022-03-15 20:10:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 20:10:00,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:00,241 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] [2022-03-15 20:10:00,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 20:10:00,241 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:00,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1519744848, now seen corresponding path program 1 times [2022-03-15 20:10:00,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:00,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598510727] [2022-03-15 20:10:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:00,315 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:10:00,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:00,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598510727] [2022-03-15 20:10:00,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598510727] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:00,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:00,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:00,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445813080] [2022-03-15 20:10:00,316 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:00,318 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:00,321 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 25 transitions. [2022-03-15 20:10:00,321 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:00,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:00,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:00,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:00,322 INFO L87 Difference]: Start difference. First operand 2367 states and 4561 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:00,540 INFO L93 Difference]: Finished difference Result 2369 states and 4563 transitions. [2022-03-15 20:10:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 20:10:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:00,543 INFO L225 Difference]: With dead ends: 2369 [2022-03-15 20:10:00,543 INFO L226 Difference]: Without dead ends: 2320 [2022-03-15 20:10:00,543 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:10:00,544 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:00,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:10:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-03-15 20:10:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2022-03-15 20:10:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 2291 states have (on average 1.9598428633784373) internal successors, (4490), 2319 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 4490 transitions. [2022-03-15 20:10:00,566 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 4490 transitions. Word has length 25 [2022-03-15 20:10:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:00,567 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 4490 transitions. [2022-03-15 20:10:00,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 4490 transitions. [2022-03-15 20:10:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:10:00,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:00,567 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:10:00,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-15 20:10:00,568 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -821605399, now seen corresponding path program 1 times [2022-03-15 20:10:00,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:00,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294872542] [2022-03-15 20:10:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:00,688 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:10:00,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:00,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294872542] [2022-03-15 20:10:00,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294872542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:00,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:00,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:10:00,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471290483] [2022-03-15 20:10:00,688 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:00,691 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:00,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 34 transitions. [2022-03-15 20:10:00,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:00,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:00,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:00,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1063804#(not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|))] [2022-03-15 20:10:00,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:10:00,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:10:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:10:00,745 INFO L87 Difference]: Start difference. First operand 2320 states and 4490 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 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:10:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:01,053 INFO L93 Difference]: Finished difference Result 2306 states and 4460 transitions. [2022-03-15 20:10:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:10:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 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:10:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:01,056 INFO L225 Difference]: With dead ends: 2306 [2022-03-15 20:10:01,056 INFO L226 Difference]: Without dead ends: 2306 [2022-03-15 20:10:01,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:10:01,056 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 357 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:01,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 81 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 20:10:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-03-15 20:10:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2250. [2022-03-15 20:10:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2224 states have (on average 1.95863309352518) internal successors, (4356), 2249 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 4356 transitions. [2022-03-15 20:10:01,077 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 4356 transitions. Word has length 26 [2022-03-15 20:10:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:01,077 INFO L470 AbstractCegarLoop]: Abstraction has 2250 states and 4356 transitions. [2022-03-15 20:10:01,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 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:10:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 4356 transitions. [2022-03-15 20:10:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 20:10:01,078 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:01,078 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:10:01,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-15 20:10:01,078 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1196104346, now seen corresponding path program 1 times [2022-03-15 20:10:01,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:01,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070294208] [2022-03-15 20:10:01,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:01,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:01,194 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:10:01,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:01,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070294208] [2022-03-15 20:10:01,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070294208] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:01,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:01,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-15 20:10:01,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794745881] [2022-03-15 20:10:01,195 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:01,198 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:01,208 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 74 transitions. [2022-03-15 20:10:01,208 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:01,363 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:01,364 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:01,366 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:01,366 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:01,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:01,400 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1070633#(not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|))] [2022-03-15 20:10:01,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 20:10:01,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 20:10:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 20:10:01,401 INFO L87 Difference]: Start difference. First operand 2250 states and 4356 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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:10:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:02,012 INFO L93 Difference]: Finished difference Result 2266 states and 4384 transitions. [2022-03-15 20:10:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 20:10:02,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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 26 [2022-03-15 20:10:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:02,015 INFO L225 Difference]: With dead ends: 2266 [2022-03-15 20:10:02,015 INFO L226 Difference]: Without dead ends: 2266 [2022-03-15 20:10:02,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-03-15 20:10:02,015 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 443 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:02,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 184 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 20:10:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-03-15 20:10:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2165. [2022-03-15 20:10:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 2141 states have (on average 1.9556282111163008) internal successors, (4187), 2164 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 4187 transitions. [2022-03-15 20:10:02,036 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 4187 transitions. Word has length 26 [2022-03-15 20:10:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:02,036 INFO L470 AbstractCegarLoop]: Abstraction has 2165 states and 4187 transitions. [2022-03-15 20:10:02,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 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:10:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 4187 transitions. [2022-03-15 20:10:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:02,037 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:02,038 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] [2022-03-15 20:10:02,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-15 20:10:02,038 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1149606650, now seen corresponding path program 1 times [2022-03-15 20:10:02,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:02,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671678333] [2022-03-15 20:10:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:02,347 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:10:02,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:02,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671678333] [2022-03-15 20:10:02,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671678333] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:02,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:02,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:02,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656454273] [2022-03-15 20:10:02,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:02,352 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:02,370 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 58 transitions. [2022-03-15 20:10:02,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:02,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:02,735 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1077258#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 1077256#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1077259#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|))), 1077257#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1077255#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:10:02,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:10:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:10:02,736 INFO L87 Difference]: Start difference. First operand 2165 states and 4187 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:04,338 INFO L93 Difference]: Finished difference Result 2604 states and 4975 transitions. [2022-03-15 20:10:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 20:10:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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 34 [2022-03-15 20:10:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:04,342 INFO L225 Difference]: With dead ends: 2604 [2022-03-15 20:10:04,342 INFO L226 Difference]: Without dead ends: 2604 [2022-03-15 20:10:04,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2022-03-15 20:10:04,343 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 620 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:04,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 149 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:10:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2022-03-15 20:10:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2179. [2022-03-15 20:10:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 2155 states have (on average 1.9559164733178653) internal successors, (4215), 2178 states have internal predecessors, (4215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 4215 transitions. [2022-03-15 20:10:04,365 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 4215 transitions. Word has length 34 [2022-03-15 20:10:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:04,365 INFO L470 AbstractCegarLoop]: Abstraction has 2179 states and 4215 transitions. [2022-03-15 20:10:04,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 4215 transitions. [2022-03-15 20:10:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:04,366 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:04,366 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] [2022-03-15 20:10:04,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-15 20:10:04,367 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1034700350, now seen corresponding path program 2 times [2022-03-15 20:10:04,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:04,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401827597] [2022-03-15 20:10:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:04,675 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:10:04,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:04,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401827597] [2022-03-15 20:10:04,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401827597] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:04,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:04,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:04,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497139827] [2022-03-15 20:10:04,676 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:04,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:04,697 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 60 transitions. [2022-03-15 20:10:04,697 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:04,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:04,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:04,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:04,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:04,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:04,963 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:04,964 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:04,975 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:04,976 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:05,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:05,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:05,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:05,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10 treesize of output 4 [2022-03-15 20:10:05,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10 treesize of output 4 [2022-03-15 20:10:05,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1084264#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|))), 1084261#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1084265#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1084262#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1084263#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)))] [2022-03-15 20:10:05,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:10:05,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:10:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:10:05,072 INFO L87 Difference]: Start difference. First operand 2179 states and 4215 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:06,575 INFO L93 Difference]: Finished difference Result 2719 states and 5203 transitions. [2022-03-15 20:10:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 20:10:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 34 [2022-03-15 20:10:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:06,579 INFO L225 Difference]: With dead ends: 2719 [2022-03-15 20:10:06,579 INFO L226 Difference]: Without dead ends: 2719 [2022-03-15 20:10:06,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 20:10:06,580 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 543 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:06,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 134 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:10:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2022-03-15 20:10:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2193. [2022-03-15 20:10:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2169 states have (on average 1.9562010142923005) internal successors, (4243), 2192 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 4243 transitions. [2022-03-15 20:10:06,608 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 4243 transitions. Word has length 34 [2022-03-15 20:10:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:06,608 INFO L470 AbstractCegarLoop]: Abstraction has 2193 states and 4243 transitions. [2022-03-15 20:10:06,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 4243 transitions. [2022-03-15 20:10:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:06,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:06,610 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] [2022-03-15 20:10:06,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-15 20:10:06,611 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash -372674468, now seen corresponding path program 3 times [2022-03-15 20:10:06,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:06,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686848993] [2022-03-15 20:10:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:06,871 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:10:06,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:06,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686848993] [2022-03-15 20:10:06,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686848993] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:06,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:06,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:06,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [213851028] [2022-03-15 20:10:06,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:06,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:06,898 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 62 transitions. [2022-03-15 20:10:06,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:06,908 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:06,908 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:06,918 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:06,918 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:06,965 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:06,966 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:06,967 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:06,967 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:07,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10 treesize of output 4 [2022-03-15 20:10:07,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10 treesize of output 4 [2022-03-15 20:10:07,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:07,356 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1091417#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 1091416#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1091415#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1091418#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|))), 1091414#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:07,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 20:10:07,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 20:10:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-03-15 20:10:07,357 INFO L87 Difference]: Start difference. First operand 2193 states and 4243 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:08,887 INFO L93 Difference]: Finished difference Result 2834 states and 5431 transitions. [2022-03-15 20:10:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 20:10:08,887 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 20:10:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:08,891 INFO L225 Difference]: With dead ends: 2834 [2022-03-15 20:10:08,891 INFO L226 Difference]: Without dead ends: 2834 [2022-03-15 20:10:08,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 20:10:08,892 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 565 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:08,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 119 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:10:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2022-03-15 20:10:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2207. [2022-03-15 20:10:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2183 states have (on average 1.956481905634448) internal successors, (4271), 2206 states have internal predecessors, (4271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 4271 transitions. [2022-03-15 20:10:08,920 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 4271 transitions. Word has length 34 [2022-03-15 20:10:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:08,920 INFO L470 AbstractCegarLoop]: Abstraction has 2207 states and 4271 transitions. [2022-03-15 20:10:08,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 4271 transitions. [2022-03-15 20:10:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:08,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:08,926 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] [2022-03-15 20:10:08,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-15 20:10:08,927 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1295938216, now seen corresponding path program 4 times [2022-03-15 20:10:08,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:08,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428627138] [2022-03-15 20:10:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:09,321 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:10:09,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:09,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428627138] [2022-03-15 20:10:09,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428627138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:09,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:09,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:09,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035786545] [2022-03-15 20:10:09,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:09,339 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:09,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 46 transitions. [2022-03-15 20:10:09,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:09,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:09,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:09,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:09,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1098714#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|))), 1098715#(and (not (= |~#t1~0.base| |my_callbackThread1of1ForFork1_#in~arg.base|)) (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)))] [2022-03-15 20:10:09,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:10:09,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:10:09,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:10:09,511 INFO L87 Difference]: Start difference. First operand 2207 states and 4271 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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:10:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:11,244 INFO L93 Difference]: Finished difference Result 2856 states and 5473 transitions. [2022-03-15 20:10:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 20:10:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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 34 [2022-03-15 20:10:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:11,248 INFO L225 Difference]: With dead ends: 2856 [2022-03-15 20:10:11,248 INFO L226 Difference]: Without dead ends: 2856 [2022-03-15 20:10:11,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=770, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:10:11,249 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 470 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:11,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 117 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 20:10:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2022-03-15 20:10:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2128. [2022-03-15 20:10:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2104 states have (on average 1.954847908745247) internal successors, (4113), 2127 states have internal predecessors, (4113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 4113 transitions. [2022-03-15 20:10:11,277 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 4113 transitions. Word has length 34 [2022-03-15 20:10:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:11,277 INFO L470 AbstractCegarLoop]: Abstraction has 2128 states and 4113 transitions. [2022-03-15 20:10:11,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 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:10:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 4113 transitions. [2022-03-15 20:10:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:11,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:11,278 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] [2022-03-15 20:10:11,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-15 20:10:11,279 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2129805924, now seen corresponding path program 1 times [2022-03-15 20:10:11,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:11,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608492764] [2022-03-15 20:10:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:11,686 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:10:11,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:11,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608492764] [2022-03-15 20:10:11,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608492764] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:11,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:11,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:11,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578947940] [2022-03-15 20:10:11,687 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:11,693 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:11,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 38 transitions. [2022-03-15 20:10:11,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:11,716 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:11,717 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:11,720 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:11,721 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:11,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:11,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:11,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:11,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 20:10:11,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 20:10:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-03-15 20:10:11,747 INFO L87 Difference]: Start difference. First operand 2128 states and 4113 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:10:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:13,214 INFO L93 Difference]: Finished difference Result 2576 states and 4923 transitions. [2022-03-15 20:10:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 20:10:13,215 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 34 [2022-03-15 20:10:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:13,218 INFO L225 Difference]: With dead ends: 2576 [2022-03-15 20:10:13,218 INFO L226 Difference]: Without dead ends: 2576 [2022-03-15 20:10:13,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-03-15 20:10:13,219 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 454 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:13,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 225 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 20:10:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-03-15 20:10:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2108. [2022-03-15 20:10:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2084 states have (on average 1.9544145873320538) internal successors, (4073), 2107 states have internal predecessors, (4073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 4073 transitions. [2022-03-15 20:10:13,244 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 4073 transitions. Word has length 34 [2022-03-15 20:10:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:13,244 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 4073 transitions. [2022-03-15 20:10:13,244 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:10:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 4073 transitions. [2022-03-15 20:10:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:13,245 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:13,245 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] [2022-03-15 20:10:13,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-15 20:10:13,245 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 842787430, now seen corresponding path program 2 times [2022-03-15 20:10:13,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:13,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375684749] [2022-03-15 20:10:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:13,620 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:10:13,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:13,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375684749] [2022-03-15 20:10:13,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375684749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:13,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:13,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:13,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603094074] [2022-03-15 20:10:13,620 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:13,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:13,640 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 44 transitions. [2022-03-15 20:10:13,640 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:13,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,714 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:13,714 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:13,719 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:13,719 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:13,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:13,796 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1112702#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:13,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 20:10:13,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 20:10:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-15 20:10:13,797 INFO L87 Difference]: Start difference. First operand 2108 states and 4073 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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:10:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:15,202 INFO L93 Difference]: Finished difference Result 2613 states and 4995 transitions. [2022-03-15 20:10:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 20:10:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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 34 [2022-03-15 20:10:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:15,206 INFO L225 Difference]: With dead ends: 2613 [2022-03-15 20:10:15,206 INFO L226 Difference]: Without dead ends: 2613 [2022-03-15 20:10:15,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2022-03-15 20:10:15,207 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 483 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:15,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 215 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 20:10:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2022-03-15 20:10:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2088. [2022-03-15 20:10:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2064 states have (on average 1.9539728682170543) internal successors, (4033), 2087 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 4033 transitions. [2022-03-15 20:10:15,231 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 4033 transitions. Word has length 34 [2022-03-15 20:10:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:15,231 INFO L470 AbstractCegarLoop]: Abstraction has 2088 states and 4033 transitions. [2022-03-15 20:10:15,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 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:10:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 4033 transitions. [2022-03-15 20:10:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:15,232 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:15,232 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] [2022-03-15 20:10:15,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-15 20:10:15,232 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:15,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 201294862, now seen corresponding path program 3 times [2022-03-15 20:10:15,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:15,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321082110] [2022-03-15 20:10:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:15,620 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:10:15,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:15,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321082110] [2022-03-15 20:10:15,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321082110] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:15,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:15,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:15,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101811797] [2022-03-15 20:10:15,621 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:15,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:15,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 50 transitions. [2022-03-15 20:10:15,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:15,662 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:15,663 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:15,666 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:15,666 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:15,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:15,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1119525#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1119526#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:15,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 20:10:15,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:15,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 20:10:15,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 20:10:15,996 INFO L87 Difference]: Start difference. First operand 2088 states and 4033 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:10:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:17,331 INFO L93 Difference]: Finished difference Result 2650 states and 5067 transitions. [2022-03-15 20:10:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 20:10:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 34 [2022-03-15 20:10:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:17,335 INFO L225 Difference]: With dead ends: 2650 [2022-03-15 20:10:17,335 INFO L226 Difference]: Without dead ends: 2650 [2022-03-15 20:10:17,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2022-03-15 20:10:17,336 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 497 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:17,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 199 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 20:10:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-03-15 20:10:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2068. [2022-03-15 20:10:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 2044 states have (on average 1.953522504892368) internal successors, (3993), 2067 states have internal predecessors, (3993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 3993 transitions. [2022-03-15 20:10:17,363 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 3993 transitions. Word has length 34 [2022-03-15 20:10:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:17,363 INFO L470 AbstractCegarLoop]: Abstraction has 2068 states and 3993 transitions. [2022-03-15 20:10:17,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:10:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 3993 transitions. [2022-03-15 20:10:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 20:10:17,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:17,364 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] [2022-03-15 20:10:17,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-15 20:10:17,365 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -319457930, now seen corresponding path program 4 times [2022-03-15 20:10:17,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:17,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445967612] [2022-03-15 20:10:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:17,651 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:10:17,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:17,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445967612] [2022-03-15 20:10:17,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445967612] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:17,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:17,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-15 20:10:17,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [780599971] [2022-03-15 20:10:17,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:17,658 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:17,677 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 56 transitions. [2022-03-15 20:10:17,677 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:17,682 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:17,683 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:17,686 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 20:10:17,687 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-03-15 20:10:17,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:17,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-03-15 20:10:18,123 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1126349#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1126350#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0)), 1126348#(and (not (= |my_callbackThread1of1ForFork0_#in~arg.base| |~#t1~0.base|)) (= 0 (select (select |#race| |~#t1~0.base|) |~#t1~0.offset|)) (= (select (select |#race| |~#t1~0.base|) (+ 2 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ 3 |~#t1~0.offset|)) 0) (= (select (select |#race| |~#t1~0.base|) (+ |~#t1~0.offset| 1)) 0))] [2022-03-15 20:10:18,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 20:10:18,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 20:10:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-03-15 20:10:18,124 INFO L87 Difference]: Start difference. First operand 2068 states and 3993 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:10:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:20,230 INFO L93 Difference]: Finished difference Result 2746 states and 5262 transitions. [2022-03-15 20:10:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 20:10:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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 34 [2022-03-15 20:10:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:20,234 INFO L225 Difference]: With dead ends: 2746 [2022-03-15 20:10:20,234 INFO L226 Difference]: Without dead ends: 2746 [2022-03-15 20:10:20,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=806, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 20:10:20,235 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 435 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:20,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 214 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3097 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 20:10:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-03-15 20:10:20,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1950. [2022-03-15 20:10:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1927 states have (on average 1.9522573949143747) internal successors, (3762), 1949 states have internal predecessors, (3762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3762 transitions. [2022-03-15 20:10:20,261 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3762 transitions. Word has length 34 [2022-03-15 20:10:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:20,261 INFO L470 AbstractCegarLoop]: Abstraction has 1950 states and 3762 transitions. [2022-03-15 20:10:20,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:10:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3762 transitions. [2022-03-15 20:10:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-15 20:10:20,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:20,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:20,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-15 20:10:20,262 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -877126082, now seen corresponding path program 1 times [2022-03-15 20:10:20,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:20,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315613712] [2022-03-15 20:10:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 20:10:20,350 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:10:20,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 20:10:20,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315613712] [2022-03-15 20:10:20,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315613712] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 20:10:20,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 20:10:20,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 20:10:20,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230737677] [2022-03-15 20:10:20,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 20:10:20,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 20:10:20,377 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 67 transitions. [2022-03-15 20:10:20,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 20:10:20,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 20:10:20,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 20:10:20,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 20:10:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 20:10:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 20:10:20,393 INFO L87 Difference]: Start difference. First operand 1950 states and 3762 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 20:10:20,765 INFO L93 Difference]: Finished difference Result 2058 states and 3973 transitions. [2022-03-15 20:10:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 20:10:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-03-15 20:10:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 20:10:20,768 INFO L225 Difference]: With dead ends: 2058 [2022-03-15 20:10:20,768 INFO L226 Difference]: Without dead ends: 2058 [2022-03-15 20:10:20,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:10:20,769 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 45 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 20:10:20,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 78 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 20:10:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-03-15 20:10:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2028. [2022-03-15 20:10:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 2005 states have (on average 1.9521197007481297) internal successors, (3914), 2027 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 3914 transitions. [2022-03-15 20:10:20,793 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 3914 transitions. Word has length 39 [2022-03-15 20:10:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 20:10:20,794 INFO L470 AbstractCegarLoop]: Abstraction has 2028 states and 3914 transitions. [2022-03-15 20:10:20,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 20:10:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 3914 transitions. [2022-03-15 20:10:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 20:10:20,796 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 20:10:20,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 20:10:20,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-15 20:10:20,796 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-15 20:10:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 20:10:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 885654502, now seen corresponding path program 1 times [2022-03-15 20:10:20,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 20:10:20,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518864279] [2022-03-15 20:10:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 20:10:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 20:10:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:10:20,895 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 20:10:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 20:10:21,018 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 20:10:21,018 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 20:10:21,020 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-15 20:10:21,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-15 20:10:21,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-15 20:10:21,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-15 20:10:21,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-15 20:10:21,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-15 20:10:21,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-15 20:10:21,025 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-15 20:10:21,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-15 20:10:21,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-15 20:10:21,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-15 20:10:21,026 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-15 20:10:21,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2022-03-15 20:10:21,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-15 20:10:21,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (10 of 25 remaining) [2022-03-15 20:10:21,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (9 of 25 remaining) [2022-03-15 20:10:21,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-15 20:10:21,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-15 20:10:21,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-15 20:10:21,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-15 20:10:21,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-15 20:10:21,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-15 20:10:21,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-15 20:10:21,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-15 20:10:21,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-15 20:10:21,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-15 20:10:21,032 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 2, 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:10:21,037 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:10:21,037 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:10:21,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:10:21 BasicIcfg [2022-03-15 20:10:21,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:10:21,124 INFO L158 Benchmark]: Toolchain (without parser) took 109998.75ms. Allocated memory was 186.6MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 132.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 186.6MB. Free memory was 152.4MB in the beginning and 152.4MB in the end (delta: 75.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.09ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 132.0MB in the beginning and 153.6MB in the end (delta: -21.7MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.01ms. Allocated memory is still 224.4MB. Free memory was 153.6MB in the beginning and 149.1MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: Boogie Preprocessor took 48.94ms. Allocated memory is still 224.4MB. Free memory was 149.1MB in the beginning and 145.2MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: RCFGBuilder took 709.10ms. Allocated memory is still 224.4MB. Free memory was 145.2MB in the beginning and 176.8MB in the end (delta: -31.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 20:10:21,125 INFO L158 Benchmark]: TraceAbstraction took 108527.78ms. Allocated memory was 224.4MB in the beginning and 6.4GB in the end (delta: 6.1GB). Free memory was 176.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-03-15 20:10:21,126 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.23ms. Allocated memory is still 186.6MB. Free memory was 152.4MB in the beginning and 152.4MB in the end (delta: 75.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 617.09ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 132.0MB in the beginning and 153.6MB in the end (delta: -21.7MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.01ms. Allocated memory is still 224.4MB. Free memory was 153.6MB in the beginning and 149.1MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.94ms. Allocated memory is still 224.4MB. Free memory was 149.1MB in the beginning and 145.2MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.10ms. Allocated memory is still 224.4MB. Free memory was 145.2MB in the beginning and 176.8MB in the end (delta: -31.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 108527.78ms. Allocated memory was 224.4MB in the beginning and 6.4GB in the end (delta: 6.1GB). Free memory was 176.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.5s, 329 PlacesBefore, 138 PlacesAfterwards, 331 TransitionsBefore, 137 TransitionsAfterwards, 19368 CoEnabledTransitionPairs, 10 FixpointIterations, 123 TrivialSequentialCompositions, 103 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 29 ConcurrentYvCompositions, 3 ChoiceCompositions, 267 TotalNumberOfCompositions, 151343 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16075, positive: 13627, positive conditional: 0, positive unconditional: 13627, negative: 2448, negative conditional: 0, negative unconditional: 2448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7993, positive: 7819, positive conditional: 0, positive unconditional: 7819, negative: 174, negative conditional: 0, negative unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16075, positive: 5808, positive conditional: 0, positive unconditional: 5808, negative: 2274, negative conditional: 0, negative unconditional: 2274, unknown: 7993, unknown conditional: 0, unknown unconditional: 7993] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 328, Positive conditional cache size: 0, Positive unconditional cache size: 328, Negative cache size: 117, Negative conditional cache size: 0, Negative unconditional cache size: 117 - 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: 1734]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1,t2; [L1748] CALL, EXPR 0 my_drv_init() [L1742] 0 return 0; [L1748] RET, EXPR 0 my_drv_init() [L1748] 0 int ret = my_drv_init(); [L1749] COND TRUE 0 ret==0 [L1750] 0 int probe_ret; [L1751] 0 struct my_data data; [L1752] CALL, EXPR 0 my_drv_probe(&data) [L1717] 0 struct device *d = &data->dev; [L1719] 0 data->shared.a = 0 [L1720] 0 data->shared.b = 0 [L1721] 0 int res = __VERIFIER_nondet_int(); [L1722] COND FALSE 0 !(\read(res)) [L1724] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-5, res=0, t1={3:0}, t2={4:0}] [L1707] 1 struct device *dev = (struct device*)arg; [L1708] 1 struct my_data *data; [L1709] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1709] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1725] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-4, res=0, t1={3:0}, t2={4:0}] [L1726] 0 return 0; [L1752] RET, EXPR 0 my_drv_probe(&data) [L1752] 0 probe_ret = my_drv_probe(&data) [L1753] COND TRUE 0 probe_ret==0 [L1754] CALL 0 my_drv_disconnect(&data) [L1732] 0 void *status; [L1733] EXPR 0 \read(t1) VAL [\read(t1)=-5, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1733] 0 pthread_join(t1, &status) VAL [\read(t1)=-5, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1711] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1712] EXPR 1 data->shared.b VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={3:0}, t2={4:0}] [L1712] EXPR 1 data->shared.b + 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={3:0}, t2={4:0}] [L1712] 1 data->shared.b = data->shared.b + 1 [L1714] 1 return 0; [L1707] 2 struct device *dev = (struct device*)arg; [L1708] 2 struct my_data *data; [L1709] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1709] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1711] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1733] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-5, \result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_join(t1, &status)={0:0}, status={6:0}, t1={3:0}, t2={4:0}] [L1734] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, data->shared.a = 3=1160, dev={5:24}, status={6:0}, t1={3:0}, t2={4:0}] [L1711] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.a = 1=1156, dev={5:24}, t1={3:0}, t2={4:0}] [L1734] 0 data->shared.a = 3 VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, data->shared.a = 1=1156, data->shared.a = 3=1160, dev={5:24}, status={6:0}, t1={3:0}, t2={4: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: data->shared.b = data->shared.b + 1 [1712] * C: data->shared.b = data->shared.b + 1 [1712] * C: data->shared.a = 0 [1719] * C: data->shared.a = 1 [1711] * C: data->shared.a = 0 [1719] * C: pthread_join(t1, &status) [1733] * C: data->shared.b = 0 [1720] * C: data->shared.b = 0 [1720] * C: data->shared.b + 1 [1712] * C: data->shared.a = 0 [1719] * C: data->shared.a = 1 [1711] * C: data->shared.a = 0 [1719] * C: data->shared.b + 1 [1712] * C: data->shared.b + 1 [1712] * C: pthread_join(t1, &status) [1733] * C: data->shared.a = 1 [1711] * C: data->shared.b = data->shared.b + 1 [1712] * C: pthread_join(t1, &status) [1733] * C: data->shared.b = 0 [1720] * C: data->shared.b = 0 [1720] * C: data->shared.b = data->shared.b + 1 [1712] * C: data->shared.b + 1 [1712] * C: data->shared.a = 1 [1711] * C: pthread_join(t1, &status) [1733] and C: data->shared.a = 3 [1734] - UnprovableResult [Line: 1719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1759]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1735]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1736]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1737]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1724]: 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: 1725]: 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: 1711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1712]: 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 4 procedures, 362 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 108.3s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9270 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9270 mSDsluCounter, 4779 SdHoareTripleChecker+Invalid, 19.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5328 mSDsCounter, 2340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36290 IncrementalHoareTripleChecker+Invalid, 38630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2340 mSolverCounterUnsat, 2759 mSDtfsCounter, 36290 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 218 SyntacticMatches, 21 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36167occurred in iteration=9, InterpolantAutomatonStates: 309, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 12987 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 8828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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:10:21,247 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...