/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 16:52:47,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 16:52:47,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 16:52:47,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 16:52:47,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 16:52:47,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 16:52:47,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 16:52:47,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 16:52:47,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 16:52:47,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 16:52:47,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 16:52:47,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 16:52:47,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 16:52:47,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 16:52:47,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 16:52:47,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 16:52:47,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 16:52:47,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 16:52:47,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 16:52:47,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 16:52:47,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 16:52:47,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 16:52:47,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 16:52:47,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 16:52:47,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 16:52:47,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 16:52:47,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 16:52:47,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 16:52:47,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 16:52:47,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 16:52:47,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 16:52:47,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 16:52:47,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 16:52:47,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 16:52:47,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 16:52:47,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 16:52:47,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 16:52:47,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 16:52:47,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 16:52:47,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 16:52:47,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 16:52:47,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 16:52:47,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 16:52:47,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 16:52:47,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 16:52:47,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 16:52:47,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 16:52:47,916 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 16:52:47,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 16:52:47,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 16:52:47,916 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 16:52:47,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 16:52:47,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 16:52:47,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 16:52:47,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 16:52:47,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 16:52:47,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 16:52:47,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 16:52:47,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 16:52:47,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 16:52:47,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:52:47,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 16:52:47,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 16:52:47,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-03-01 16:52:48,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 16:52:48,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 16:52:48,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 16:52:48,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 16:52:48,193 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 16:52:48,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-01 16:52:48,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d29997bc/7b2cc6656bb74c128e4c26e2cc9e9e55/FLAGe4dc3d462 [2022-03-01 16:52:48,834 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 16:52:48,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_16-arrayloop_rc.i [2022-03-01 16:52:48,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d29997bc/7b2cc6656bb74c128e4c26e2cc9e9e55/FLAGe4dc3d462 [2022-03-01 16:52:49,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d29997bc/7b2cc6656bb74c128e4c26e2cc9e9e55 [2022-03-01 16:52:49,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 16:52:49,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 16:52:49,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 16:52:49,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 16:52:49,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 16:52:49,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6449e164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49, skipping insertion in model container [2022-03-01 16:52:49,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 16:52:49,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 16:52:49,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:52:49,668 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 16:52:49,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 16:52:49,765 INFO L208 MainTranslator]: Completed translation [2022-03-01 16:52:49,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49 WrapperNode [2022-03-01 16:52:49,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 16:52:49,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 16:52:49,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 16:52:49,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 16:52:49,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,824 INFO L137 Inliner]: procedures = 369, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 237 [2022-03-01 16:52:49,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 16:52:49,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 16:52:49,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 16:52:49,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 16:52:49,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 16:52:49,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 16:52:49,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 16:52:49,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 16:52:49,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (1/1) ... [2022-03-01 16:52:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 16:52:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:49,940 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-01 16:52:49,958 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-01 16:52:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-03-01 16:52:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-03-01 16:52:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-03-01 16:52:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 16:52:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 16:52:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 16:52:49,978 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 16:52:50,093 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 16:52:50,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 16:52:50,488 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 16:52:50,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 16:52:50,498 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 16:52:50,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:52:50 BoogieIcfgContainer [2022-03-01 16:52:50,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 16:52:50,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 16:52:50,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 16:52:50,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 16:52:50,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 04:52:49" (1/3) ... [2022-03-01 16:52:50,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c457ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:52:50, skipping insertion in model container [2022-03-01 16:52:50,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 04:52:49" (2/3) ... [2022-03-01 16:52:50,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c457ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 04:52:50, skipping insertion in model container [2022-03-01 16:52:50,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 04:52:50" (3/3) ... [2022-03-01 16:52:50,517 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.i [2022-03-01 16:52:50,522 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 16:52:50,522 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 16:52:50,522 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-03-01 16:52:50,522 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 16:52:50,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,573 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,574 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,575 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,576 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,577 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,578 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,579 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,580 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,581 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,600 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,601 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,602 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,603 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,604 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,610 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,611 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,612 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,658 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,658 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,658 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,658 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,658 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,670 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,671 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,675 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,676 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,677 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,678 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,678 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,679 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,688 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,688 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~mem33#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,688 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,689 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~malloc30#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,689 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,689 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,689 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,689 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,690 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,691 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,691 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,691 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,691 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~list#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_new_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,692 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~node#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~list#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_~temp~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret38#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,693 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_list_add_#in~node#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,694 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,694 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 16:52:50,696 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 16:52:50,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 16:52:50,754 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 16:52:50,755 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-03-01 16:52:50,770 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 274 transitions, 553 flow [2022-03-01 16:52:51,011 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-01 16:52:51,052 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:51,052 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] [2022-03-01 16:52:51,053 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 121722460, now seen corresponding path program 1 times [2022-03-01 16:52:51,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:51,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778743271] [2022-03-01 16:52:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:51,462 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-01 16:52:51,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:51,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778743271] [2022-03-01 16:52:51,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778743271] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:52:51,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:52:51,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:52:51,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907609035] [2022-03-01 16:52:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:51,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:52:51,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:52:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:52:51,518 INFO L87 Difference]: Start difference. First operand has 9626 states, 9554 states have (on average 2.027527737073477) internal successors, (19371), 9625 states have internal predecessors, (19371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-01 16:52:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:52,377 INFO L93 Difference]: Finished difference Result 10027 states and 19985 transitions. [2022-03-01 16:52:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:52:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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 40 [2022-03-01 16:52:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:52,444 INFO L225 Difference]: With dead ends: 10027 [2022-03-01 16:52:52,444 INFO L226 Difference]: Without dead ends: 10027 [2022-03-01 16:52:52,446 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-01 16:52:52,453 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 246 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:52,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 890 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:52:52,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-03-01 16:52:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9946. [2022-03-01 16:52:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9946 states, 9875 states have (on average 2.007392405063291) internal successors, (19823), 9945 states have internal predecessors, (19823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9946 states to 9946 states and 19823 transitions. [2022-03-01 16:52:52,833 INFO L78 Accepts]: Start accepts. Automaton has 9946 states and 19823 transitions. Word has length 40 [2022-03-01 16:52:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:52,833 INFO L470 AbstractCegarLoop]: Abstraction has 9946 states and 19823 transitions. [2022-03-01 16:52:52,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 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-01 16:52:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9946 states and 19823 transitions. [2022-03-01 16:52:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-01 16:52:52,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:52,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:52,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 16:52:52,845 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -964891731, now seen corresponding path program 1 times [2022-03-01 16:52:52,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:52,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025249659] [2022-03-01 16:52:52,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:52,970 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-01 16:52:52,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:52,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025249659] [2022-03-01 16:52:52,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025249659] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:52:52,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:52:52,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:52:52,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953292565] [2022-03-01 16:52:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:52,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:52:52,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:52:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:52:52,973 INFO L87 Difference]: Start difference. First operand 9946 states and 19823 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:52:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:53,622 INFO L93 Difference]: Finished difference Result 10347 states and 20626 transitions. [2022-03-01 16:52:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:52:53,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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 48 [2022-03-01 16:52:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:53,669 INFO L225 Difference]: With dead ends: 10347 [2022-03-01 16:52:53,669 INFO L226 Difference]: Without dead ends: 10347 [2022-03-01 16:52:53,670 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-01 16:52:53,671 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 244 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:53,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 937 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:52:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-01 16:52:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10266. [2022-03-01 16:52:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10266 states, 10196 states have (on average 2.0070615927814828) internal successors, (20464), 10265 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10266 states to 10266 states and 20464 transitions. [2022-03-01 16:52:53,975 INFO L78 Accepts]: Start accepts. Automaton has 10266 states and 20464 transitions. Word has length 48 [2022-03-01 16:52:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:53,975 INFO L470 AbstractCegarLoop]: Abstraction has 10266 states and 20464 transitions. [2022-03-01 16:52:53,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 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-01 16:52:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10266 states and 20464 transitions. [2022-03-01 16:52:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-01 16:52:53,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:53,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:53,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 16:52:53,981 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1248115734, now seen corresponding path program 1 times [2022-03-01 16:52:53,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:53,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190591285] [2022-03-01 16:52:53,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:54,031 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-01 16:52:54,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:54,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190591285] [2022-03-01 16:52:54,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190591285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:52:54,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:52:54,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 16:52:54,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235569408] [2022-03-01 16:52:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:54,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 16:52:54,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 16:52:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:52:54,033 INFO L87 Difference]: Start difference. First operand 10266 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:54,186 INFO L93 Difference]: Finished difference Result 19601 states and 39093 transitions. [2022-03-01 16:52:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 16:52:54,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-03-01 16:52:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:54,257 INFO L225 Difference]: With dead ends: 19601 [2022-03-01 16:52:54,257 INFO L226 Difference]: Without dead ends: 19601 [2022-03-01 16:52:54,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 16:52:54,260 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 226 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:54,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 550 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:52:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19601 states. [2022-03-01 16:52:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19601 to 10348. [2022-03-01 16:52:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10348 states, 10278 states have (on average 2.0070052539404553) internal successors, (20628), 10347 states have internal predecessors, (20628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10348 states to 10348 states and 20628 transitions. [2022-03-01 16:52:54,704 INFO L78 Accepts]: Start accepts. Automaton has 10348 states and 20628 transitions. Word has length 49 [2022-03-01 16:52:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:54,704 INFO L470 AbstractCegarLoop]: Abstraction has 10348 states and 20628 transitions. [2022-03-01 16:52:54,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10348 states and 20628 transitions. [2022-03-01 16:52:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-01 16:52:54,705 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:54,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:54,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 16:52:54,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash -119349012, now seen corresponding path program 1 times [2022-03-01 16:52:54,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:54,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658711874] [2022-03-01 16:52:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:54,829 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-01 16:52:54,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:54,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658711874] [2022-03-01 16:52:54,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658711874] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:52:54,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:52:54,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:52:54,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058666873] [2022-03-01 16:52:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:54,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:52:54,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:52:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:52:54,831 INFO L87 Difference]: Start difference. First operand 10348 states and 20628 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:55,001 INFO L93 Difference]: Finished difference Result 10347 states and 20627 transitions. [2022-03-01 16:52:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:52:55,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-03-01 16:52:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:55,026 INFO L225 Difference]: With dead ends: 10347 [2022-03-01 16:52:55,027 INFO L226 Difference]: Without dead ends: 10347 [2022-03-01 16:52:55,027 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-01 16:52:55,028 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:55,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 397 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:52:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-03-01 16:52:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 10347. [2022-03-01 16:52:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10347 states, 10278 states have (on average 2.006907958746838) internal successors, (20627), 10346 states have internal predecessors, (20627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10347 states to 10347 states and 20627 transitions. [2022-03-01 16:52:55,288 INFO L78 Accepts]: Start accepts. Automaton has 10347 states and 20627 transitions. Word has length 59 [2022-03-01 16:52:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:55,289 INFO L470 AbstractCegarLoop]: Abstraction has 10347 states and 20627 transitions. [2022-03-01 16:52:55,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 10347 states and 20627 transitions. [2022-03-01 16:52:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-03-01 16:52:55,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:55,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:55,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 16:52:55,293 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1111224204, now seen corresponding path program 1 times [2022-03-01 16:52:55,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:55,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776360067] [2022-03-01 16:52:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:55,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:55,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776360067] [2022-03-01 16:52:55,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776360067] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:55,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324905474] [2022-03-01 16:52:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:55,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:55,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:55,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:52:55,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-01 16:52:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:55,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 16:52:55,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:55,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:52:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:56,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324905474] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:52:56,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:52:56,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 16:52:56,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150970336] [2022-03-01 16:52:56,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:52:56,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 16:52:56,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 16:52:56,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 16:52:56,032 INFO L87 Difference]: Start difference. First operand 10347 states and 20627 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:56,349 INFO L93 Difference]: Finished difference Result 19642 states and 39134 transitions. [2022-03-01 16:52:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:52:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 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 90 [2022-03-01 16:52:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:56,401 INFO L225 Difference]: With dead ends: 19642 [2022-03-01 16:52:56,401 INFO L226 Difference]: Without dead ends: 19642 [2022-03-01 16:52:56,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:52:56,403 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 489 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:56,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 1608 Invalid, 196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:52:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19642 states. [2022-03-01 16:52:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19642 to 10429. [2022-03-01 16:52:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10429 states, 10360 states have (on average 1.9989382239382238) internal successors, (20709), 10428 states have internal predecessors, (20709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 20709 transitions. [2022-03-01 16:52:56,681 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 20709 transitions. Word has length 90 [2022-03-01 16:52:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:56,682 INFO L470 AbstractCegarLoop]: Abstraction has 10429 states and 20709 transitions. [2022-03-01 16:52:56,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 20709 transitions. [2022-03-01 16:52:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-03-01 16:52:56,684 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:56,684 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:56,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-01 16:52:56,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:56,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash -227998028, now seen corresponding path program 2 times [2022-03-01 16:52:56,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:56,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446208354] [2022-03-01 16:52:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:57,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:57,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446208354] [2022-03-01 16:52:57,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446208354] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:57,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438694014] [2022-03-01 16:52:57,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:52:57,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:57,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:52:57,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-01 16:52:57,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:52:57,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:52:57,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-01 16:52:57,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:57,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:52:57,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2022-03-01 16:52:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:52:57,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-03-01 16:52:57,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:52:57,630 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:52:57,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-03-01 16:52:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-03-01 16:52:57,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:52:57,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438694014] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:52:57,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:52:57,657 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-03-01 16:52:57,657 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062213684] [2022-03-01 16:52:57,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:52:57,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 16:52:57,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:52:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 16:52:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:52:57,659 INFO L87 Difference]: Start difference. First operand 10429 states and 20709 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:52:58,531 INFO L93 Difference]: Finished difference Result 12090 states and 24032 transitions. [2022-03-01 16:52:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 16:52:58,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 172 [2022-03-01 16:52:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:52:58,562 INFO L225 Difference]: With dead ends: 12090 [2022-03-01 16:52:58,562 INFO L226 Difference]: Without dead ends: 12090 [2022-03-01 16:52:58,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:52:58,564 INFO L933 BasicCegarLoop]: 726 mSDtfsCounter, 729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:52:58,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 2448 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:52:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2022-03-01 16:52:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 10867. [2022-03-01 16:52:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10867 states, 10798 states have (on average 1.9989812928320059) internal successors, (21585), 10866 states have internal predecessors, (21585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 21585 transitions. [2022-03-01 16:52:58,818 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 21585 transitions. Word has length 172 [2022-03-01 16:52:58,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:52:58,820 INFO L470 AbstractCegarLoop]: Abstraction has 10867 states and 21585 transitions. [2022-03-01 16:52:58,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:52:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 21585 transitions. [2022-03-01 16:52:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-03-01 16:52:58,822 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:52:58,822 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:52:58,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-01 16:52:59,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-01 16:52:59,040 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:52:59,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:52:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1836787897, now seen corresponding path program 1 times [2022-03-01 16:52:59,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:52:59,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64807126] [2022-03-01 16:52:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:52:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:59,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:52:59,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64807126] [2022-03-01 16:52:59,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64807126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:52:59,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006133183] [2022-03-01 16:52:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:52:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:52:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:52:59,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:52:59,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-01 16:52:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:52:59,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 16:52:59,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:52:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:52:59,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:00,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006133183] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:00,246 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:00,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 16:53:00,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025774146] [2022-03-01 16:53:00,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:00,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 16:53:00,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:00,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 16:53:00,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:53:00,248 INFO L87 Difference]: Start difference. First operand 10867 states and 21585 transitions. Second operand has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:00,709 INFO L93 Difference]: Finished difference Result 20585 states and 40856 transitions. [2022-03-01 16:53:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:53:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 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 180 [2022-03-01 16:53:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:00,772 INFO L225 Difference]: With dead ends: 20585 [2022-03-01 16:53:00,772 INFO L226 Difference]: Without dead ends: 20585 [2022-03-01 16:53:00,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2022-03-01 16:53:00,773 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 805 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:00,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2497 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:53:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20585 states. [2022-03-01 16:53:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20585 to 11031. [2022-03-01 16:53:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11031 states, 10962 states have (on average 1.9840357598978289) internal successors, (21749), 11030 states have internal predecessors, (21749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11031 states to 11031 states and 21749 transitions. [2022-03-01 16:53:01,064 INFO L78 Accepts]: Start accepts. Automaton has 11031 states and 21749 transitions. Word has length 180 [2022-03-01 16:53:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:01,065 INFO L470 AbstractCegarLoop]: Abstraction has 11031 states and 21749 transitions. [2022-03-01 16:53:01,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.22222222222222) internal successors, (346), 18 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11031 states and 21749 transitions. [2022-03-01 16:53:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2022-03-01 16:53:01,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:01,070 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:01,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:01,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:01,292 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1455200967, now seen corresponding path program 2 times [2022-03-01 16:53:01,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:01,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886907237] [2022-03-01 16:53:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:01,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:01,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886907237] [2022-03-01 16:53:01,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886907237] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:01,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768648069] [2022-03-01 16:53:01,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:53:01,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:01,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:01,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:01,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-01 16:53:01,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:53:01,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:53:01,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-01 16:53:01,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:02,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-01 16:53:02,447 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-01 16:53:02,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-03-01 16:53:02,487 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-03-01 16:53:02,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-03-01 16:53:02,544 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-03-01 16:53:02,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-03-01 16:53:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-03-01 16:53:02,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:53:02,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768648069] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:02,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:53:02,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2022-03-01 16:53:02,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543868460] [2022-03-01 16:53:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:02,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:53:02,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:53:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:02,571 INFO L87 Difference]: Start difference. First operand 11031 states and 21749 transitions. Second operand has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:03,201 INFO L93 Difference]: Finished difference Result 11586 states and 22859 transitions. [2022-03-01 16:53:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:53:03,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 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 344 [2022-03-01 16:53:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:03,230 INFO L225 Difference]: With dead ends: 11586 [2022-03-01 16:53:03,231 INFO L226 Difference]: Without dead ends: 11586 [2022-03-01 16:53:03,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:03,232 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 314 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:03,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 1050 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:53:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2022-03-01 16:53:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11469. [2022-03-01 16:53:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11469 states, 11400 states have (on average 1.9846491228070176) internal successors, (22625), 11468 states have internal predecessors, (22625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 22625 transitions. [2022-03-01 16:53:03,451 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 22625 transitions. Word has length 344 [2022-03-01 16:53:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:03,452 INFO L470 AbstractCegarLoop]: Abstraction has 11469 states and 22625 transitions. [2022-03-01 16:53:03,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.6) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 22625 transitions. [2022-03-01 16:53:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-03-01 16:53:03,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:03,458 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:03,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 16:53:03,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:03,676 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -368948921, now seen corresponding path program 1 times [2022-03-01 16:53:03,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:03,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537004412] [2022-03-01 16:53:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:04,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:04,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537004412] [2022-03-01 16:53:04,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537004412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:53:04,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109921556] [2022-03-01 16:53:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:04,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:04,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:53:04,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:53:04,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-01 16:53:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:04,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 16:53:04,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:53:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:05,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:53:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 16:53:05,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109921556] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:53:05,740 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:53:05,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-03-01 16:53:05,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565932805] [2022-03-01 16:53:05,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:53:05,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 16:53:05,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:05,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 16:53:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:53:05,742 INFO L87 Difference]: Start difference. First operand 11469 states and 22625 transitions. Second operand has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:06,264 INFO L93 Difference]: Finished difference Result 21487 states and 42537 transitions. [2022-03-01 16:53:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:53:06,264 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 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 353 [2022-03-01 16:53:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:06,309 INFO L225 Difference]: With dead ends: 21487 [2022-03-01 16:53:06,309 INFO L226 Difference]: Without dead ends: 21487 [2022-03-01 16:53:06,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:53:06,313 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1141 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:06,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 3468 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:53:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21487 states. [2022-03-01 16:53:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21487 to 11592. [2022-03-01 16:53:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11592 states, 11523 states have (on average 1.9741386791634123) internal successors, (22748), 11591 states have internal predecessors, (22748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11592 states to 11592 states and 22748 transitions. [2022-03-01 16:53:06,544 INFO L78 Accepts]: Start accepts. Automaton has 11592 states and 22748 transitions. Word has length 353 [2022-03-01 16:53:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:06,545 INFO L470 AbstractCegarLoop]: Abstraction has 11592 states and 22748 transitions. [2022-03-01 16:53:06,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 20.782608695652176) internal successors, (478), 23 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11592 states and 22748 transitions. [2022-03-01 16:53:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:06,554 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:06,554 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:06,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-01 16:53:06,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:53:06,779 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1637359643, now seen corresponding path program 2 times [2022-03-01 16:53:06,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:06,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843804241] [2022-03-01 16:53:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:07,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:07,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843804241] [2022-03-01 16:53:07,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843804241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:07,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:07,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:07,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752179838] [2022-03-01 16:53:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:07,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:07,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:07,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:07,219 INFO L87 Difference]: Start difference. First operand 11592 states and 22748 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:08,534 INFO L93 Difference]: Finished difference Result 11725 states and 23014 transitions. [2022-03-01 16:53:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:53:08,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:08,560 INFO L225 Difference]: With dead ends: 11725 [2022-03-01 16:53:08,561 INFO L226 Difference]: Without dead ends: 11725 [2022-03-01 16:53:08,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:53:08,561 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 636 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:08,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 2930 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:53:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2022-03-01 16:53:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11609. [2022-03-01 16:53:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11540 states have (on average 1.9741767764298093) internal successors, (22782), 11608 states have internal predecessors, (22782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 22782 transitions. [2022-03-01 16:53:08,818 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 22782 transitions. Word has length 476 [2022-03-01 16:53:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:08,819 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 22782 transitions. [2022-03-01 16:53:08,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 22782 transitions. [2022-03-01 16:53:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:08,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:08,823 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:08,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 16:53:08,824 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1557491129, now seen corresponding path program 3 times [2022-03-01 16:53:08,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:08,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345568135] [2022-03-01 16:53:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:09,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:09,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345568135] [2022-03-01 16:53:09,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345568135] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:09,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:09,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:09,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587065830] [2022-03-01 16:53:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:09,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:09,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:09,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:09,191 INFO L87 Difference]: Start difference. First operand 11609 states and 22782 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:10,365 INFO L93 Difference]: Finished difference Result 11752 states and 23068 transitions. [2022-03-01 16:53:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:53:10,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:10,387 INFO L225 Difference]: With dead ends: 11752 [2022-03-01 16:53:10,388 INFO L226 Difference]: Without dead ends: 11752 [2022-03-01 16:53:10,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-01 16:53:10,389 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 566 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:10,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 2927 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:53:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11752 states. [2022-03-01 16:53:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11752 to 11610. [2022-03-01 16:53:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11610 states, 11541 states have (on average 1.9741790139502642) internal successors, (22784), 11609 states have internal predecessors, (22784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 22784 transitions. [2022-03-01 16:53:10,585 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 22784 transitions. Word has length 476 [2022-03-01 16:53:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:10,585 INFO L470 AbstractCegarLoop]: Abstraction has 11610 states and 22784 transitions. [2022-03-01 16:53:10,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 22784 transitions. [2022-03-01 16:53:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:10,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:10,590 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:10,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 16:53:10,590 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash 988805515, now seen corresponding path program 4 times [2022-03-01 16:53:10,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:10,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145340054] [2022-03-01 16:53:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:10,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:10,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145340054] [2022-03-01 16:53:10,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145340054] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:10,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:10,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:10,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370885943] [2022-03-01 16:53:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:10,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:10,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:10,973 INFO L87 Difference]: Start difference. First operand 11610 states and 22784 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:12,480 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-01 16:53:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:53:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:12,494 INFO L225 Difference]: With dead ends: 11790 [2022-03-01 16:53:12,494 INFO L226 Difference]: Without dead ends: 11790 [2022-03-01 16:53:12,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:53:12,495 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 590 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 2769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:12,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 3473 Invalid, 2769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:53:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-01 16:53:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11633. [2022-03-01 16:53:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 11564 states have (on average 1.9743168453822206) internal successors, (22831), 11632 states have internal predecessors, (22831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 22831 transitions. [2022-03-01 16:53:12,665 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 22831 transitions. Word has length 476 [2022-03-01 16:53:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:12,666 INFO L470 AbstractCegarLoop]: Abstraction has 11633 states and 22831 transitions. [2022-03-01 16:53:12,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 22831 transitions. [2022-03-01 16:53:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:12,669 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:12,670 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:12,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 16:53:12,670 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 695892193, now seen corresponding path program 5 times [2022-03-01 16:53:12,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:12,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126119671] [2022-03-01 16:53:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:13,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:13,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126119671] [2022-03-01 16:53:13,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126119671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:13,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:13,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:13,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447878441] [2022-03-01 16:53:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:13,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:13,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:13,069 INFO L87 Difference]: Start difference. First operand 11633 states and 22831 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:14,108 INFO L93 Difference]: Finished difference Result 11790 states and 23144 transitions. [2022-03-01 16:53:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:53:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:14,129 INFO L225 Difference]: With dead ends: 11790 [2022-03-01 16:53:14,130 INFO L226 Difference]: Without dead ends: 11790 [2022-03-01 16:53:14,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:53:14,131 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 505 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:14,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2610 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:53:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2022-03-01 16:53:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11635. [2022-03-01 16:53:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11635 states, 11566 states have (on average 1.974321286529483) internal successors, (22835), 11634 states have internal predecessors, (22835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 22835 transitions. [2022-03-01 16:53:14,306 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 22835 transitions. Word has length 476 [2022-03-01 16:53:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:14,307 INFO L470 AbstractCegarLoop]: Abstraction has 11635 states and 22835 transitions. [2022-03-01 16:53:14,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 22835 transitions. [2022-03-01 16:53:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:14,313 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:14,314 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:14,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 16:53:14,314 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1052778459, now seen corresponding path program 6 times [2022-03-01 16:53:14,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:14,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504962327] [2022-03-01 16:53:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:14,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:14,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504962327] [2022-03-01 16:53:14,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504962327] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:14,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:14,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:14,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998040209] [2022-03-01 16:53:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:14,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:14,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:14,672 INFO L87 Difference]: Start difference. First operand 11635 states and 22835 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:15,989 INFO L93 Difference]: Finished difference Result 11854 states and 23272 transitions. [2022-03-01 16:53:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:53:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:16,006 INFO L225 Difference]: With dead ends: 11854 [2022-03-01 16:53:16,006 INFO L226 Difference]: Without dead ends: 11854 [2022-03-01 16:53:16,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:53:16,007 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 523 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:16,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 3135 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:53:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2022-03-01 16:53:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 11634. [2022-03-01 16:53:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11565 states have (on average 1.97431906614786) internal successors, (22833), 11633 states have internal predecessors, (22833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 22833 transitions. [2022-03-01 16:53:16,220 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 22833 transitions. Word has length 476 [2022-03-01 16:53:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:16,221 INFO L470 AbstractCegarLoop]: Abstraction has 11634 states and 22833 transitions. [2022-03-01 16:53:16,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 22833 transitions. [2022-03-01 16:53:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:16,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:16,225 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:16,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 16:53:16,226 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1137607131, now seen corresponding path program 7 times [2022-03-01 16:53:16,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:16,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223393912] [2022-03-01 16:53:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:16,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:16,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223393912] [2022-03-01 16:53:16,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223393912] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:16,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:16,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:16,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397922341] [2022-03-01 16:53:16,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:16,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:16,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:16,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:16,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:16,583 INFO L87 Difference]: Start difference. First operand 11634 states and 22833 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:17,642 INFO L93 Difference]: Finished difference Result 11855 states and 23274 transitions. [2022-03-01 16:53:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:53:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:17,656 INFO L225 Difference]: With dead ends: 11855 [2022-03-01 16:53:17,657 INFO L226 Difference]: Without dead ends: 11855 [2022-03-01 16:53:17,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:17,657 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 548 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:17,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2649 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:53:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2022-03-01 16:53:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 11657. [2022-03-01 16:53:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11657 states, 11588 states have (on average 1.9744563341387642) internal successors, (22880), 11656 states have internal predecessors, (22880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 22880 transitions. [2022-03-01 16:53:17,814 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 22880 transitions. Word has length 476 [2022-03-01 16:53:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:17,814 INFO L470 AbstractCegarLoop]: Abstraction has 11657 states and 22880 transitions. [2022-03-01 16:53:17,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 22880 transitions. [2022-03-01 16:53:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:17,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:17,819 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:17,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 16:53:17,819 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1627233295, now seen corresponding path program 8 times [2022-03-01 16:53:17,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:17,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521687902] [2022-03-01 16:53:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:18,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:18,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521687902] [2022-03-01 16:53:18,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521687902] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:18,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:18,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:18,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144795607] [2022-03-01 16:53:18,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:18,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:18,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:18,286 INFO L87 Difference]: Start difference. First operand 11657 states and 22880 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:19,433 INFO L93 Difference]: Finished difference Result 11923 states and 23410 transitions. [2022-03-01 16:53:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:53:19,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:19,451 INFO L225 Difference]: With dead ends: 11923 [2022-03-01 16:53:19,451 INFO L226 Difference]: Without dead ends: 11923 [2022-03-01 16:53:19,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2022-03-01 16:53:19,452 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 950 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:19,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 2658 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:53:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11923 states. [2022-03-01 16:53:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11923 to 11681. [2022-03-01 16:53:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11681 states, 11612 states have (on average 1.9745952462969343) internal successors, (22929), 11680 states have internal predecessors, (22929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 22929 transitions. [2022-03-01 16:53:19,588 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 22929 transitions. Word has length 476 [2022-03-01 16:53:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:19,588 INFO L470 AbstractCegarLoop]: Abstraction has 11681 states and 22929 transitions. [2022-03-01 16:53:19,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 22929 transitions. [2022-03-01 16:53:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:19,591 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:19,592 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:19,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 16:53:19,592 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1984499955, now seen corresponding path program 9 times [2022-03-01 16:53:19,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:19,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808588106] [2022-03-01 16:53:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:19,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:19,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808588106] [2022-03-01 16:53:19,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808588106] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:19,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:19,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:19,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359351841] [2022-03-01 16:53:19,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:19,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:19,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:19,953 INFO L87 Difference]: Start difference. First operand 11681 states and 22929 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:21,271 INFO L93 Difference]: Finished difference Result 12163 states and 23890 transitions. [2022-03-01 16:53:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-01 16:53:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:21,289 INFO L225 Difference]: With dead ends: 12163 [2022-03-01 16:53:21,289 INFO L226 Difference]: Without dead ends: 12163 [2022-03-01 16:53:21,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-03-01 16:53:21,290 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1055 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:21,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 3332 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:53:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2022-03-01 16:53:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11685. [2022-03-01 16:53:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11685 states, 11616 states have (on average 1.9746039944903582) internal successors, (22937), 11684 states have internal predecessors, (22937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11685 states to 11685 states and 22937 transitions. [2022-03-01 16:53:21,521 INFO L78 Accepts]: Start accepts. Automaton has 11685 states and 22937 transitions. Word has length 476 [2022-03-01 16:53:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:21,522 INFO L470 AbstractCegarLoop]: Abstraction has 11685 states and 22937 transitions. [2022-03-01 16:53:21,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11685 states and 22937 transitions. [2022-03-01 16:53:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:21,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:21,527 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:21,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 16:53:21,527 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1263639721, now seen corresponding path program 10 times [2022-03-01 16:53:21,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:21,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519797605] [2022-03-01 16:53:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:21,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:21,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519797605] [2022-03-01 16:53:21,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519797605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:21,906 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:21,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:21,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796395931] [2022-03-01 16:53:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:21,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:21,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:21,908 INFO L87 Difference]: Start difference. First operand 11685 states and 22937 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:23,467 INFO L93 Difference]: Finished difference Result 21888 states and 43344 transitions. [2022-03-01 16:53:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:53:23,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:23,503 INFO L225 Difference]: With dead ends: 21888 [2022-03-01 16:53:23,503 INFO L226 Difference]: Without dead ends: 21888 [2022-03-01 16:53:23,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:53:23,504 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1716 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4143 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:23,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1716 Valid, 4143 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:53:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-03-01 16:53:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 11752. [2022-03-01 16:53:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11683 states have (on average 1.974835230677052) internal successors, (23072), 11751 states have internal predecessors, (23072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 23072 transitions. [2022-03-01 16:53:23,742 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 23072 transitions. Word has length 476 [2022-03-01 16:53:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:23,742 INFO L470 AbstractCegarLoop]: Abstraction has 11752 states and 23072 transitions. [2022-03-01 16:53:23,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 23072 transitions. [2022-03-01 16:53:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:23,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:23,747 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:23,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 16:53:23,747 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash -142092517, now seen corresponding path program 1 times [2022-03-01 16:53:23,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:23,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820620038] [2022-03-01 16:53:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:24,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:24,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820620038] [2022-03-01 16:53:24,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820620038] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:24,074 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:24,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:24,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135317269] [2022-03-01 16:53:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:24,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:24,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:24,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:24,076 INFO L87 Difference]: Start difference. First operand 11752 states and 23072 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:25,908 INFO L93 Difference]: Finished difference Result 21740 states and 43045 transitions. [2022-03-01 16:53:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-01 16:53:25,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:25,948 INFO L225 Difference]: With dead ends: 21740 [2022-03-01 16:53:25,949 INFO L226 Difference]: Without dead ends: 21740 [2022-03-01 16:53:25,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2022-03-01 16:53:25,950 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1507 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:25,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 4516 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:53:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21740 states. [2022-03-01 16:53:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21740 to 11831. [2022-03-01 16:53:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11831 states, 11762 states have (on average 1.9750042509777248) internal successors, (23230), 11830 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 23230 transitions. [2022-03-01 16:53:26,194 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 23230 transitions. Word has length 476 [2022-03-01 16:53:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:26,195 INFO L470 AbstractCegarLoop]: Abstraction has 11831 states and 23230 transitions. [2022-03-01 16:53:26,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 23230 transitions. [2022-03-01 16:53:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:26,199 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:26,199 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:26,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 16:53:26,199 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 821726293, now seen corresponding path program 2 times [2022-03-01 16:53:26,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:26,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243859037] [2022-03-01 16:53:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:26,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:26,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:26,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243859037] [2022-03-01 16:53:26,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243859037] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:26,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:26,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:26,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11659862] [2022-03-01 16:53:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:26,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:26,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:26,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:26,536 INFO L87 Difference]: Start difference. First operand 11831 states and 23230 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:27,214 INFO L93 Difference]: Finished difference Result 12198 states and 23964 transitions. [2022-03-01 16:53:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:53:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:27,229 INFO L225 Difference]: With dead ends: 12198 [2022-03-01 16:53:27,229 INFO L226 Difference]: Without dead ends: 12198 [2022-03-01 16:53:27,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:27,230 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:27,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2224 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:53:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12198 states. [2022-03-01 16:53:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12198 to 11856. [2022-03-01 16:53:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11856 states, 11787 states have (on average 1.9750572664800203) internal successors, (23280), 11855 states have internal predecessors, (23280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11856 states to 11856 states and 23280 transitions. [2022-03-01 16:53:27,369 INFO L78 Accepts]: Start accepts. Automaton has 11856 states and 23280 transitions. Word has length 476 [2022-03-01 16:53:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:27,369 INFO L470 AbstractCegarLoop]: Abstraction has 11856 states and 23280 transitions. [2022-03-01 16:53:27,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11856 states and 23280 transitions. [2022-03-01 16:53:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:27,372 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:27,372 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:27,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-01 16:53:27,372 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:27,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2028045517, now seen corresponding path program 3 times [2022-03-01 16:53:27,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:27,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445342735] [2022-03-01 16:53:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:27,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:27,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445342735] [2022-03-01 16:53:27,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445342735] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:27,719 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:27,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:27,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803262430] [2022-03-01 16:53:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:27,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:27,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:27,721 INFO L87 Difference]: Start difference. First operand 11856 states and 23280 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:28,603 INFO L93 Difference]: Finished difference Result 12278 states and 24124 transitions. [2022-03-01 16:53:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:53:28,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:28,618 INFO L225 Difference]: With dead ends: 12278 [2022-03-01 16:53:28,618 INFO L226 Difference]: Without dead ends: 12278 [2022-03-01 16:53:28,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:28,619 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 358 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 2542 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:28,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 2542 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:53:28,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2022-03-01 16:53:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 11864. [2022-03-01 16:53:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11864 states, 11795 states have (on average 1.975074183976261) internal successors, (23296), 11863 states have internal predecessors, (23296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11864 states to 11864 states and 23296 transitions. [2022-03-01 16:53:28,748 INFO L78 Accepts]: Start accepts. Automaton has 11864 states and 23296 transitions. Word has length 476 [2022-03-01 16:53:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:28,748 INFO L470 AbstractCegarLoop]: Abstraction has 11864 states and 23296 transitions. [2022-03-01 16:53:28,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11864 states and 23296 transitions. [2022-03-01 16:53:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:28,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:28,751 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:28,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-01 16:53:28,751 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash 568044087, now seen corresponding path program 4 times [2022-03-01 16:53:28,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:28,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277674119] [2022-03-01 16:53:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:29,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:29,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277674119] [2022-03-01 16:53:29,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277674119] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:29,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:29,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:29,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065353702] [2022-03-01 16:53:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:29,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:29,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:29,065 INFO L87 Difference]: Start difference. First operand 11864 states and 23296 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:29,950 INFO L93 Difference]: Finished difference Result 12342 states and 24252 transitions. [2022-03-01 16:53:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:53:29,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:29,962 INFO L225 Difference]: With dead ends: 12342 [2022-03-01 16:53:29,963 INFO L226 Difference]: Without dead ends: 12342 [2022-03-01 16:53:29,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:29,963 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 372 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:29,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 2554 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:53:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-03-01 16:53:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 11872. [2022-03-01 16:53:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11872 states, 11803 states have (on average 1.9750910785393545) internal successors, (23312), 11871 states have internal predecessors, (23312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11872 states to 11872 states and 23312 transitions. [2022-03-01 16:53:30,096 INFO L78 Accepts]: Start accepts. Automaton has 11872 states and 23312 transitions. Word has length 476 [2022-03-01 16:53:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:30,096 INFO L470 AbstractCegarLoop]: Abstraction has 11872 states and 23312 transitions. [2022-03-01 16:53:30,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11872 states and 23312 transitions. [2022-03-01 16:53:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:30,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:30,099 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:30,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-01 16:53:30,100 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1053384145, now seen corresponding path program 5 times [2022-03-01 16:53:30,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:30,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245261599] [2022-03-01 16:53:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:30,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:30,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245261599] [2022-03-01 16:53:30,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245261599] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:30,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:30,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:30,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206688247] [2022-03-01 16:53:30,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:30,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:30,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:30,407 INFO L87 Difference]: Start difference. First operand 11872 states and 23312 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:31,758 INFO L93 Difference]: Finished difference Result 22094 states and 43756 transitions. [2022-03-01 16:53:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:53:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:31,791 INFO L225 Difference]: With dead ends: 22094 [2022-03-01 16:53:31,791 INFO L226 Difference]: Without dead ends: 22094 [2022-03-01 16:53:31,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:53:31,792 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 914 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:31,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 3873 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:53:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22094 states. [2022-03-01 16:53:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22094 to 11904. [2022-03-01 16:53:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11904 states, 11835 states have (on average 1.9751584283903676) internal successors, (23376), 11903 states have internal predecessors, (23376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11904 states to 11904 states and 23376 transitions. [2022-03-01 16:53:31,978 INFO L78 Accepts]: Start accepts. Automaton has 11904 states and 23376 transitions. Word has length 476 [2022-03-01 16:53:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:31,978 INFO L470 AbstractCegarLoop]: Abstraction has 11904 states and 23376 transitions. [2022-03-01 16:53:31,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11904 states and 23376 transitions. [2022-03-01 16:53:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:31,981 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:31,981 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:31,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-01 16:53:31,981 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:31,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1555409893, now seen corresponding path program 11 times [2022-03-01 16:53:31,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:31,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350171285] [2022-03-01 16:53:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:32,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:32,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350171285] [2022-03-01 16:53:32,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350171285] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:32,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:32,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:32,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57083483] [2022-03-01 16:53:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:32,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:32,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:32,321 INFO L87 Difference]: Start difference. First operand 11904 states and 23376 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:33,722 INFO L93 Difference]: Finished difference Result 21883 states and 43334 transitions. [2022-03-01 16:53:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:53:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:33,755 INFO L225 Difference]: With dead ends: 21883 [2022-03-01 16:53:33,755 INFO L226 Difference]: Without dead ends: 21883 [2022-03-01 16:53:33,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:53:33,756 INFO L933 BasicCegarLoop]: 830 mSDtfsCounter, 1085 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:33,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 4816 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:53:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21883 states. [2022-03-01 16:53:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21883 to 11847. [2022-03-01 16:53:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-01 16:53:33,988 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-01 16:53:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:33,989 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-01 16:53:33,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-01 16:53:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:33,991 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:33,992 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:33,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-01 16:53:33,992 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1830588915, now seen corresponding path program 6 times [2022-03-01 16:53:33,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:33,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819495035] [2022-03-01 16:53:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:34,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:34,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819495035] [2022-03-01 16:53:34,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819495035] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:34,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:34,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:34,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702225472] [2022-03-01 16:53:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:34,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:34,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:34,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:34,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:34,297 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:35,932 INFO L93 Difference]: Finished difference Result 22050 states and 43668 transitions. [2022-03-01 16:53:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:53:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:35,965 INFO L225 Difference]: With dead ends: 22050 [2022-03-01 16:53:35,965 INFO L226 Difference]: Without dead ends: 22050 [2022-03-01 16:53:35,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:35,966 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 913 mSDsluCounter, 4025 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:35,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4836 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:53:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22050 states. [2022-03-01 16:53:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22050 to 11919. [2022-03-01 16:53:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-01 16:53:36,176 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-01 16:53:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:36,176 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-01 16:53:36,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-01 16:53:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:36,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:36,180 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:36,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-01 16:53:36,180 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -144415657, now seen corresponding path program 12 times [2022-03-01 16:53:36,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:36,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785563481] [2022-03-01 16:53:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:36,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:36,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785563481] [2022-03-01 16:53:36,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785563481] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:36,515 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:36,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:36,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344463241] [2022-03-01 16:53:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:36,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:36,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:36,517 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:38,133 INFO L93 Difference]: Finished difference Result 21957 states and 43482 transitions. [2022-03-01 16:53:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:53:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:38,165 INFO L225 Difference]: With dead ends: 21957 [2022-03-01 16:53:38,165 INFO L226 Difference]: Without dead ends: 21957 [2022-03-01 16:53:38,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:53:38,166 INFO L933 BasicCegarLoop]: 929 mSDtfsCounter, 1137 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:38,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 5469 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:53:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-03-01 16:53:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 11847. [2022-03-01 16:53:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11778 states have (on average 1.9750382068262864) internal successors, (23262), 11846 states have internal predecessors, (23262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 23262 transitions. [2022-03-01 16:53:38,416 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 23262 transitions. Word has length 476 [2022-03-01 16:53:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:38,416 INFO L470 AbstractCegarLoop]: Abstraction has 11847 states and 23262 transitions. [2022-03-01 16:53:38,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 23262 transitions. [2022-03-01 16:53:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:38,419 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:38,419 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:38,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-01 16:53:38,420 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1527151935, now seen corresponding path program 7 times [2022-03-01 16:53:38,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:38,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704688476] [2022-03-01 16:53:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:38,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:38,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704688476] [2022-03-01 16:53:38,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704688476] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:38,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:38,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:38,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308737277] [2022-03-01 16:53:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:38,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:38,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:38,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:38,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:38,740 INFO L87 Difference]: Start difference. First operand 11847 states and 23262 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:39,748 INFO L93 Difference]: Finished difference Result 13605 states and 26712 transitions. [2022-03-01 16:53:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:53:39,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:39,768 INFO L225 Difference]: With dead ends: 13605 [2022-03-01 16:53:39,768 INFO L226 Difference]: Without dead ends: 13605 [2022-03-01 16:53:39,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:39,769 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 603 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:39,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 2837 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:53:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13605 states. [2022-03-01 16:53:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13605 to 11867. [2022-03-01 16:53:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11798 states have (on average 1.9750805221223937) internal successors, (23302), 11866 states have internal predecessors, (23302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 23302 transitions. [2022-03-01 16:53:39,923 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 23302 transitions. Word has length 476 [2022-03-01 16:53:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:39,923 INFO L470 AbstractCegarLoop]: Abstraction has 11867 states and 23302 transitions. [2022-03-01 16:53:39,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 23302 transitions. [2022-03-01 16:53:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:39,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:39,926 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:39,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-01 16:53:39,927 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1322619875, now seen corresponding path program 8 times [2022-03-01 16:53:39,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:39,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482091171] [2022-03-01 16:53:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:39,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:40,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:40,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482091171] [2022-03-01 16:53:40,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482091171] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:40,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:40,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:40,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668787991] [2022-03-01 16:53:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:40,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:40,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:40,266 INFO L87 Difference]: Start difference. First operand 11867 states and 23302 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:41,476 INFO L93 Difference]: Finished difference Result 13688 states and 26878 transitions. [2022-03-01 16:53:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:53:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:41,496 INFO L225 Difference]: With dead ends: 13688 [2022-03-01 16:53:41,496 INFO L226 Difference]: Without dead ends: 13688 [2022-03-01 16:53:41,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:53:41,497 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 612 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:41,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 3246 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:53:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2022-03-01 16:53:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 11875. [2022-03-01 16:53:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11875 states, 11806 states have (on average 1.9750974080975776) internal successors, (23318), 11874 states have internal predecessors, (23318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11875 states to 11875 states and 23318 transitions. [2022-03-01 16:53:41,653 INFO L78 Accepts]: Start accepts. Automaton has 11875 states and 23318 transitions. Word has length 476 [2022-03-01 16:53:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:41,653 INFO L470 AbstractCegarLoop]: Abstraction has 11875 states and 23318 transitions. [2022-03-01 16:53:41,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 11875 states and 23318 transitions. [2022-03-01 16:53:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:41,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:41,656 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:41,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-01 16:53:41,657 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1273469729, now seen corresponding path program 9 times [2022-03-01 16:53:41,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:41,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885699720] [2022-03-01 16:53:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:42,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:42,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885699720] [2022-03-01 16:53:42,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885699720] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:42,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:42,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:42,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159531142] [2022-03-01 16:53:42,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:42,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:42,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:42,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:42,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:42,031 INFO L87 Difference]: Start difference. First operand 11875 states and 23318 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:43,242 INFO L93 Difference]: Finished difference Result 13858 states and 27218 transitions. [2022-03-01 16:53:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:53:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:43,261 INFO L225 Difference]: With dead ends: 13858 [2022-03-01 16:53:43,261 INFO L226 Difference]: Without dead ends: 13858 [2022-03-01 16:53:43,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:53:43,262 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 640 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:43,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [640 Valid, 3277 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:53:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2022-03-01 16:53:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 11883. [2022-03-01 16:53:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:53:43,413 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:53:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:43,413 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:53:43,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:53:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:43,416 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:43,417 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:43,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-01 16:53:43,417 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1062346467, now seen corresponding path program 10 times [2022-03-01 16:53:43,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:43,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985994394] [2022-03-01 16:53:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:43,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:43,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985994394] [2022-03-01 16:53:43,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985994394] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:43,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:43,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:43,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455817202] [2022-03-01 16:53:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:43,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:43,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:43,767 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:45,102 INFO L93 Difference]: Finished difference Result 13640 states and 26782 transitions. [2022-03-01 16:53:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:53:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:45,121 INFO L225 Difference]: With dead ends: 13640 [2022-03-01 16:53:45,121 INFO L226 Difference]: Without dead ends: 13640 [2022-03-01 16:53:45,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:53:45,122 INFO L933 BasicCegarLoop]: 668 mSDtfsCounter, 693 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:45,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 3423 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:53:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13640 states. [2022-03-01 16:53:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13640 to 11884. [2022-03-01 16:53:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 11815 states have (on average 1.9751163774862464) internal successors, (23336), 11883 states have internal predecessors, (23336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 23336 transitions. [2022-03-01 16:53:45,276 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 23336 transitions. Word has length 476 [2022-03-01 16:53:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:45,276 INFO L470 AbstractCegarLoop]: Abstraction has 11884 states and 23336 transitions. [2022-03-01 16:53:45,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 23336 transitions. [2022-03-01 16:53:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:45,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:45,279 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:45,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-01 16:53:45,280 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:45,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 382849019, now seen corresponding path program 11 times [2022-03-01 16:53:45,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:45,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96386632] [2022-03-01 16:53:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:45,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:45,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96386632] [2022-03-01 16:53:45,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96386632] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:45,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:45,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:45,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232644028] [2022-03-01 16:53:45,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:45,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:45,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:45,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:45,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:45,590 INFO L87 Difference]: Start difference. First operand 11884 states and 23336 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:47,124 INFO L93 Difference]: Finished difference Result 13799 states and 27100 transitions. [2022-03-01 16:53:47,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:53:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:47,143 INFO L225 Difference]: With dead ends: 13799 [2022-03-01 16:53:47,144 INFO L226 Difference]: Without dead ends: 13799 [2022-03-01 16:53:47,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:53:47,144 INFO L933 BasicCegarLoop]: 676 mSDtfsCounter, 691 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:47,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 3545 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:53:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13799 states. [2022-03-01 16:53:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13799 to 11883. [2022-03-01 16:53:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:53:47,291 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:53:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:47,291 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:53:47,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:53:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:47,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:47,294 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:47,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-01 16:53:47,295 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:47,295 INFO L85 PathProgramCache]: Analyzing trace with hash 153013153, now seen corresponding path program 12 times [2022-03-01 16:53:47,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:47,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598788649] [2022-03-01 16:53:47,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:47,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:47,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:47,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598788649] [2022-03-01 16:53:47,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598788649] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:47,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:47,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:47,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096792864] [2022-03-01 16:53:47,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:47,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:47,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:47,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:47,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:47,633 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:49,271 INFO L93 Difference]: Finished difference Result 13633 states and 26767 transitions. [2022-03-01 16:53:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:53:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:49,290 INFO L225 Difference]: With dead ends: 13633 [2022-03-01 16:53:49,291 INFO L226 Difference]: Without dead ends: 13633 [2022-03-01 16:53:49,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:53:49,291 INFO L933 BasicCegarLoop]: 737 mSDtfsCounter, 749 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:49,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 3816 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:53:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2022-03-01 16:53:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 11883. [2022-03-01 16:53:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11814 states have (on average 1.9751142712036567) internal successors, (23334), 11882 states have internal predecessors, (23334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 23334 transitions. [2022-03-01 16:53:49,434 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 23334 transitions. Word has length 476 [2022-03-01 16:53:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:49,434 INFO L470 AbstractCegarLoop]: Abstraction has 11883 states and 23334 transitions. [2022-03-01 16:53:49,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 23334 transitions. [2022-03-01 16:53:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:49,438 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:49,438 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:49,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-01 16:53:49,438 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1403214081, now seen corresponding path program 13 times [2022-03-01 16:53:49,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:49,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577118991] [2022-03-01 16:53:49,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:49,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:49,744 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:49,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577118991] [2022-03-01 16:53:49,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577118991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:49,745 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:49,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:49,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299187503] [2022-03-01 16:53:49,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:49,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:49,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:49,746 INFO L87 Difference]: Start difference. First operand 11883 states and 23334 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:50,662 INFO L93 Difference]: Finished difference Result 13686 states and 26874 transitions. [2022-03-01 16:53:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:53:50,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:50,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:50,682 INFO L225 Difference]: With dead ends: 13686 [2022-03-01 16:53:50,682 INFO L226 Difference]: Without dead ends: 13686 [2022-03-01 16:53:50,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:53:50,683 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 616 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:50,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 3077 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:53:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2022-03-01 16:53:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 11889. [2022-03-01 16:53:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11820 states have (on average 1.9751269035532995) internal successors, (23346), 11888 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 23346 transitions. [2022-03-01 16:53:50,892 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 23346 transitions. Word has length 476 [2022-03-01 16:53:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:50,892 INFO L470 AbstractCegarLoop]: Abstraction has 11889 states and 23346 transitions. [2022-03-01 16:53:50,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 23346 transitions. [2022-03-01 16:53:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:50,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:50,895 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:50,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-01 16:53:50,895 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 41981405, now seen corresponding path program 14 times [2022-03-01 16:53:50,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:50,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186073716] [2022-03-01 16:53:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:51,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:51,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186073716] [2022-03-01 16:53:51,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186073716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:51,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:51,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:51,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108151373] [2022-03-01 16:53:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:51,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:51,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:51,190 INFO L87 Difference]: Start difference. First operand 11889 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:52,089 INFO L93 Difference]: Finished difference Result 13769 states and 27040 transitions. [2022-03-01 16:53:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:53:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:52,109 INFO L225 Difference]: With dead ends: 13769 [2022-03-01 16:53:52,110 INFO L226 Difference]: Without dead ends: 13769 [2022-03-01 16:53:52,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:53:52,111 INFO L933 BasicCegarLoop]: 625 mSDtfsCounter, 617 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:52,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 2803 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:53:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2022-03-01 16:53:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 11888. [2022-03-01 16:53:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11888 states, 11819 states have (on average 1.9751247990523733) internal successors, (23344), 11887 states have internal predecessors, (23344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11888 states to 11888 states and 23344 transitions. [2022-03-01 16:53:52,264 INFO L78 Accepts]: Start accepts. Automaton has 11888 states and 23344 transitions. Word has length 476 [2022-03-01 16:53:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:52,264 INFO L470 AbstractCegarLoop]: Abstraction has 11888 states and 23344 transitions. [2022-03-01 16:53:52,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11888 states and 23344 transitions. [2022-03-01 16:53:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:52,267 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:52,267 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-01 16:53:52,268 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1656896287, now seen corresponding path program 15 times [2022-03-01 16:53:52,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:52,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858648471] [2022-03-01 16:53:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:52,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:52,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858648471] [2022-03-01 16:53:52,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858648471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:52,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:52,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:52,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596957671] [2022-03-01 16:53:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:52,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:52,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:52,570 INFO L87 Difference]: Start difference. First operand 11888 states and 23344 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:53,582 INFO L93 Difference]: Finished difference Result 13833 states and 27168 transitions. [2022-03-01 16:53:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:53:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:53,604 INFO L225 Difference]: With dead ends: 13833 [2022-03-01 16:53:53,604 INFO L226 Difference]: Without dead ends: 13833 [2022-03-01 16:53:53,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:53:53,605 INFO L933 BasicCegarLoop]: 632 mSDtfsCounter, 630 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:53,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 3160 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:53:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-03-01 16:53:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 11887. [2022-03-01 16:53:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9751226941952953) internal successors, (23342), 11886 states have internal predecessors, (23342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23342 transitions. [2022-03-01 16:53:53,762 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23342 transitions. Word has length 476 [2022-03-01 16:53:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:53,762 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23342 transitions. [2022-03-01 16:53:53,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23342 transitions. [2022-03-01 16:53:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:53,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:53,766 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:53,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-01 16:53:53,766 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1171556229, now seen corresponding path program 16 times [2022-03-01 16:53:53,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:53,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724454930] [2022-03-01 16:53:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:54,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:54,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724454930] [2022-03-01 16:53:54,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724454930] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:54,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:54,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:54,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632391880] [2022-03-01 16:53:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:54,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:54,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:54,079 INFO L87 Difference]: Start difference. First operand 11887 states and 23342 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:55,598 INFO L93 Difference]: Finished difference Result 23633 states and 46768 transitions. [2022-03-01 16:53:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-01 16:53:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:55,635 INFO L225 Difference]: With dead ends: 23633 [2022-03-01 16:53:55,635 INFO L226 Difference]: Without dead ends: 23633 [2022-03-01 16:53:55,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-01 16:53:55,635 INFO L933 BasicCegarLoop]: 917 mSDtfsCounter, 1277 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 4730 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:55,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 4730 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:53:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2022-03-01 16:53:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 11919. [2022-03-01 16:53:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11919 states, 11850 states have (on average 1.9751898734177216) internal successors, (23406), 11918 states have internal predecessors, (23406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11919 states to 11919 states and 23406 transitions. [2022-03-01 16:53:55,841 INFO L78 Accepts]: Start accepts. Automaton has 11919 states and 23406 transitions. Word has length 476 [2022-03-01 16:53:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:55,841 INFO L470 AbstractCegarLoop]: Abstraction has 11919 states and 23406 transitions. [2022-03-01 16:53:55,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 11919 states and 23406 transitions. [2022-03-01 16:53:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:55,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:55,844 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:55,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-01 16:53:55,845 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 514617029, now seen corresponding path program 13 times [2022-03-01 16:53:55,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:55,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73401633] [2022-03-01 16:53:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:56,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:56,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73401633] [2022-03-01 16:53:56,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73401633] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:56,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:56,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:53:56,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588929737] [2022-03-01 16:53:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:56,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:53:56,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:53:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:53:56,153 INFO L87 Difference]: Start difference. First operand 11919 states and 23406 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:58,381 INFO L93 Difference]: Finished difference Result 23388 states and 46278 transitions. [2022-03-01 16:53:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-01 16:53:58,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:58,414 INFO L225 Difference]: With dead ends: 23388 [2022-03-01 16:53:58,414 INFO L226 Difference]: Without dead ends: 23388 [2022-03-01 16:53:58,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=1574, Unknown=0, NotChecked=0, Total=2070 [2022-03-01 16:53:58,415 INFO L933 BasicCegarLoop]: 1049 mSDtfsCounter, 1521 mSDsluCounter, 5294 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:58,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1521 Valid, 6340 Invalid, 4178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-01 16:53:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23388 states. [2022-03-01 16:53:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23388 to 11863. [2022-03-01 16:53:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11863 states, 11794 states have (on average 1.9754112260471426) internal successors, (23298), 11862 states have internal predecessors, (23298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 23298 transitions. [2022-03-01 16:53:58,614 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 23298 transitions. Word has length 476 [2022-03-01 16:53:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:53:58,614 INFO L470 AbstractCegarLoop]: Abstraction has 11863 states and 23298 transitions. [2022-03-01 16:53:58,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 23298 transitions. [2022-03-01 16:53:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:53:58,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:53:58,617 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:53:58,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-01 16:53:58,618 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:53:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:53:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 289716163, now seen corresponding path program 17 times [2022-03-01 16:53:58,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:53:58,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864206821] [2022-03-01 16:53:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:53:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:53:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:53:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:53:58,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:53:58,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864206821] [2022-03-01 16:53:58,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864206821] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:53:58,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:53:58,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:53:58,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883191440] [2022-03-01 16:53:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:53:58,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:53:58,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:53:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:53:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:53:58,977 INFO L87 Difference]: Start difference. First operand 11863 states and 23298 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:53:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:53:59,919 INFO L93 Difference]: Finished difference Result 12207 states and 23984 transitions. [2022-03-01 16:53:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:53:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:53:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:53:59,935 INFO L225 Difference]: With dead ends: 12207 [2022-03-01 16:53:59,936 INFO L226 Difference]: Without dead ends: 12207 [2022-03-01 16:53:59,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:53:59,936 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 298 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:53:59,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 3240 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:53:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2022-03-01 16:54:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11879. [2022-03-01 16:54:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11810 states have (on average 1.9754445385266723) internal successors, (23330), 11878 states have internal predecessors, (23330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 23330 transitions. [2022-03-01 16:54:00,083 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 23330 transitions. Word has length 476 [2022-03-01 16:54:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:00,083 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 23330 transitions. [2022-03-01 16:54:00,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 23330 transitions. [2022-03-01 16:54:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:00,086 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:00,086 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:00,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-01 16:54:00,086 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1734911649, now seen corresponding path program 18 times [2022-03-01 16:54:00,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:00,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749026105] [2022-03-01 16:54:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:00,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:00,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749026105] [2022-03-01 16:54:00,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749026105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:00,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:00,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:00,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930823342] [2022-03-01 16:54:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:00,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:00,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:00,392 INFO L87 Difference]: Start difference. First operand 11879 states and 23330 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:01,185 INFO L93 Difference]: Finished difference Result 12290 states and 24150 transitions. [2022-03-01 16:54:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:01,201 INFO L225 Difference]: With dead ends: 12290 [2022-03-01 16:54:01,201 INFO L226 Difference]: Without dead ends: 12290 [2022-03-01 16:54:01,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-01 16:54:01,202 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 313 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:01,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 2725 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2022-03-01 16:54:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 11887. [2022-03-01 16:54:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11887 states, 11818 states have (on average 1.9754611609409376) internal successors, (23346), 11886 states have internal predecessors, (23346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11887 states to 11887 states and 23346 transitions. [2022-03-01 16:54:01,344 INFO L78 Accepts]: Start accepts. Automaton has 11887 states and 23346 transitions. Word has length 476 [2022-03-01 16:54:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:01,344 INFO L470 AbstractCegarLoop]: Abstraction has 11887 states and 23346 transitions. [2022-03-01 16:54:01,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:01,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11887 states and 23346 transitions. [2022-03-01 16:54:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:01,347 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:01,347 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:01,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-01 16:54:01,348 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 36033957, now seen corresponding path program 19 times [2022-03-01 16:54:01,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:01,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871721238] [2022-03-01 16:54:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:01,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:01,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871721238] [2022-03-01 16:54:01,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871721238] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:01,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:01,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:01,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953191847] [2022-03-01 16:54:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:01,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:01,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:01,640 INFO L87 Difference]: Start difference. First operand 11887 states and 23346 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:02,357 INFO L93 Difference]: Finished difference Result 12354 states and 24278 transitions. [2022-03-01 16:54:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:02,376 INFO L225 Difference]: With dead ends: 12354 [2022-03-01 16:54:02,376 INFO L226 Difference]: Without dead ends: 12354 [2022-03-01 16:54:02,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:54:02,377 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 330 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:02,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 2482 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:54:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12354 states. [2022-03-01 16:54:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12354 to 11895. [2022-03-01 16:54:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11895 states, 11826 states have (on average 1.9754777608658887) internal successors, (23362), 11894 states have internal predecessors, (23362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11895 states to 11895 states and 23362 transitions. [2022-03-01 16:54:02,593 INFO L78 Accepts]: Start accepts. Automaton has 11895 states and 23362 transitions. Word has length 476 [2022-03-01 16:54:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:02,594 INFO L470 AbstractCegarLoop]: Abstraction has 11895 states and 23362 transitions. [2022-03-01 16:54:02,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11895 states and 23362 transitions. [2022-03-01 16:54:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:02,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:02,597 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:02,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-01 16:54:02,597 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash 521374015, now seen corresponding path program 20 times [2022-03-01 16:54:02,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:02,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100216004] [2022-03-01 16:54:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:02,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:02,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100216004] [2022-03-01 16:54:02,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100216004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:02,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:02,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:02,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68509284] [2022-03-01 16:54:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:02,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:02,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:02,909 INFO L87 Difference]: Start difference. First operand 11895 states and 23362 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:04,551 INFO L93 Difference]: Finished difference Result 22106 states and 43782 transitions. [2022-03-01 16:54:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:54:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:04,582 INFO L225 Difference]: With dead ends: 22106 [2022-03-01 16:54:04,582 INFO L226 Difference]: Without dead ends: 22106 [2022-03-01 16:54:04,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:04,582 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 972 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 5180 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:04,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 5180 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 16:54:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22106 states. [2022-03-01 16:54:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22106 to 11927. [2022-03-01 16:54:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11858 states have (on average 1.9755439365828977) internal successors, (23426), 11926 states have internal predecessors, (23426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 23426 transitions. [2022-03-01 16:54:04,770 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 23426 transitions. Word has length 476 [2022-03-01 16:54:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:04,770 INFO L470 AbstractCegarLoop]: Abstraction has 11927 states and 23426 transitions. [2022-03-01 16:54:04,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 23426 transitions. [2022-03-01 16:54:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:04,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:04,774 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:04,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-01 16:54:04,774 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2087420023, now seen corresponding path program 14 times [2022-03-01 16:54:04,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:04,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072493931] [2022-03-01 16:54:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:04,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:05,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:05,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072493931] [2022-03-01 16:54:05,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072493931] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:05,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:05,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:05,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058177647] [2022-03-01 16:54:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:05,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:05,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:05,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:05,067 INFO L87 Difference]: Start difference. First operand 11927 states and 23426 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:06,471 INFO L93 Difference]: Finished difference Result 21911 states and 43392 transitions. [2022-03-01 16:54:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-01 16:54:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:06,501 INFO L225 Difference]: With dead ends: 21911 [2022-03-01 16:54:06,501 INFO L226 Difference]: Without dead ends: 21911 [2022-03-01 16:54:06,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-03-01 16:54:06,501 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 1149 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:06,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 4839 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-01 16:54:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21911 states. [2022-03-01 16:54:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21911 to 11848. [2022-03-01 16:54:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11779 states have (on average 1.9753799134052126) internal successors, (23268), 11847 states have internal predecessors, (23268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 23268 transitions. [2022-03-01 16:54:06,751 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 23268 transitions. Word has length 476 [2022-03-01 16:54:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:06,751 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 23268 transitions. [2022-03-01 16:54:06,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 23268 transitions. [2022-03-01 16:54:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:06,754 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:06,754 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:06,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-01 16:54:06,754 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1932368251, now seen corresponding path program 21 times [2022-03-01 16:54:06,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:06,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017164447] [2022-03-01 16:54:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:07,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:07,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017164447] [2022-03-01 16:54:07,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017164447] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:07,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:07,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:07,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342880079] [2022-03-01 16:54:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:07,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:07,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:07,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:07,035 INFO L87 Difference]: Start difference. First operand 11848 states and 23268 transitions. Second operand has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:08,441 INFO L93 Difference]: Finished difference Result 21819 states and 43200 transitions. [2022-03-01 16:54:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:08,471 INFO L225 Difference]: With dead ends: 21819 [2022-03-01 16:54:08,472 INFO L226 Difference]: Without dead ends: 21819 [2022-03-01 16:54:08,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-03-01 16:54:08,472 INFO L933 BasicCegarLoop]: 842 mSDtfsCounter, 933 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:08,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [933 Valid, 4801 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:54:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21819 states. [2022-03-01 16:54:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21819 to 11741. [2022-03-01 16:54:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 11673 states have (on average 1.9742996658956566) internal successors, (23046), 11740 states have internal predecessors, (23046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 23046 transitions. [2022-03-01 16:54:08,656 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 23046 transitions. Word has length 476 [2022-03-01 16:54:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:08,656 INFO L470 AbstractCegarLoop]: Abstraction has 11741 states and 23046 transitions. [2022-03-01 16:54:08,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.7) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 23046 transitions. [2022-03-01 16:54:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-03-01 16:54:08,660 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:08,660 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:08,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-01 16:54:08,660 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -676425787, now seen corresponding path program 15 times [2022-03-01 16:54:08,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:08,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861878348] [2022-03-01 16:54:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:08,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:08,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861878348] [2022-03-01 16:54:08,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861878348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:08,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:08,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 16:54:08,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963187833] [2022-03-01 16:54:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:08,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:54:08,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:54:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-01 16:54:08,937 INFO L87 Difference]: Start difference. First operand 11741 states and 23046 transitions. Second operand has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:10,841 INFO L93 Difference]: Finished difference Result 21742 states and 43046 transitions. [2022-03-01 16:54:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-01 16:54:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 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 476 [2022-03-01 16:54:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:10,870 INFO L225 Difference]: With dead ends: 21742 [2022-03-01 16:54:10,870 INFO L226 Difference]: Without dead ends: 21742 [2022-03-01 16:54:10,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2022-03-01 16:54:10,871 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 1095 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:10,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 5795 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 16:54:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21742 states. [2022-03-01 16:54:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21742 to 11608. [2022-03-01 16:54:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11540 states have (on average 1.974003466204506) internal successors, (22780), 11607 states have internal predecessors, (22780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 22780 transitions. [2022-03-01 16:54:11,093 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 22780 transitions. Word has length 476 [2022-03-01 16:54:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:11,093 INFO L470 AbstractCegarLoop]: Abstraction has 11608 states and 22780 transitions. [2022-03-01 16:54:11,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.727272727272727) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 22780 transitions. [2022-03-01 16:54:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-01 16:54:11,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:11,096 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:11,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-01 16:54:11,096 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash -433569237, now seen corresponding path program 1 times [2022-03-01 16:54:11,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:11,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352655555] [2022-03-01 16:54:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:11,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:11,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352655555] [2022-03-01 16:54:11,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352655555] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:11,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:11,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:54:11,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732996113] [2022-03-01 16:54:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:11,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:54:11,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:54:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:11,302 INFO L87 Difference]: Start difference. First operand 11608 states and 22780 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:11,770 INFO L93 Difference]: Finished difference Result 15459 states and 30482 transitions. [2022-03-01 16:54:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:54:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 477 [2022-03-01 16:54:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:11,792 INFO L225 Difference]: With dead ends: 15459 [2022-03-01 16:54:11,792 INFO L226 Difference]: Without dead ends: 15459 [2022-03-01 16:54:11,792 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-01 16:54:11,792 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:11,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 888 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:54:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2022-03-01 16:54:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 12246. [2022-03-01 16:54:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12246 states, 12178 states have (on average 1.975365413039908) internal successors, (24056), 12245 states have internal predecessors, (24056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12246 states to 12246 states and 24056 transitions. [2022-03-01 16:54:11,949 INFO L78 Accepts]: Start accepts. Automaton has 12246 states and 24056 transitions. Word has length 477 [2022-03-01 16:54:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:11,949 INFO L470 AbstractCegarLoop]: Abstraction has 12246 states and 24056 transitions. [2022-03-01 16:54:11,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 12246 states and 24056 transitions. [2022-03-01 16:54:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2022-03-01 16:54:11,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:11,952 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:11,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-01 16:54:11,953 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -162702783, now seen corresponding path program 1 times [2022-03-01 16:54:11,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:11,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119226348] [2022-03-01 16:54:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:12,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:12,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119226348] [2022-03-01 16:54:12,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119226348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:12,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:12,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:54:12,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642292183] [2022-03-01 16:54:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:12,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:54:12,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:54:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:54:12,161 INFO L87 Difference]: Start difference. First operand 12246 states and 24056 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:12,843 INFO L93 Difference]: Finished difference Result 14561 states and 28686 transitions. [2022-03-01 16:54:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:54:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 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 477 [2022-03-01 16:54:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:12,863 INFO L225 Difference]: With dead ends: 14561 [2022-03-01 16:54:12,863 INFO L226 Difference]: Without dead ends: 14561 [2022-03-01 16:54:12,863 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-01 16:54:12,864 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 325 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:12,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1220 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:54:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14561 states. [2022-03-01 16:54:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14561 to 12666. [2022-03-01 16:54:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12666 states, 12600 states have (on average 1.9758730158730158) internal successors, (24896), 12665 states have internal predecessors, (24896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12666 states to 12666 states and 24896 transitions. [2022-03-01 16:54:13,031 INFO L78 Accepts]: Start accepts. Automaton has 12666 states and 24896 transitions. Word has length 477 [2022-03-01 16:54:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 12666 states and 24896 transitions. [2022-03-01 16:54:13,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 12666 states and 24896 transitions. [2022-03-01 16:54:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:13,035 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:13,036 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:13,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-01 16:54:13,036 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -849059536, now seen corresponding path program 1 times [2022-03-01 16:54:13,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:13,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106486681] [2022-03-01 16:54:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:13,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:13,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106486681] [2022-03-01 16:54:13,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106486681] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:13,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:13,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:13,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627947157] [2022-03-01 16:54:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:13,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:13,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:13,330 INFO L87 Difference]: Start difference. First operand 12666 states and 24896 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:14,343 INFO L93 Difference]: Finished difference Result 12802 states and 25168 transitions. [2022-03-01 16:54:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 16:54:14,344 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:14,358 INFO L225 Difference]: With dead ends: 12802 [2022-03-01 16:54:14,358 INFO L226 Difference]: Without dead ends: 12802 [2022-03-01 16:54:14,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:54:14,359 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 565 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:14,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 2745 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-03-01 16:54:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 12683. [2022-03-01 16:54:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12683 states, 12617 states have (on average 1.9759055242926211) internal successors, (24930), 12682 states have internal predecessors, (24930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12683 states to 12683 states and 24930 transitions. [2022-03-01 16:54:14,506 INFO L78 Accepts]: Start accepts. Automaton has 12683 states and 24930 transitions. Word has length 484 [2022-03-01 16:54:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:14,506 INFO L470 AbstractCegarLoop]: Abstraction has 12683 states and 24930 transitions. [2022-03-01 16:54:14,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12683 states and 24930 transitions. [2022-03-01 16:54:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:14,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:14,510 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:14,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-01 16:54:14,510 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -253401254, now seen corresponding path program 2 times [2022-03-01 16:54:14,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:14,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985802639] [2022-03-01 16:54:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:14,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:14,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985802639] [2022-03-01 16:54:14,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985802639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:14,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:14,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:14,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127022584] [2022-03-01 16:54:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:14,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:14,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:14,770 INFO L87 Difference]: Start difference. First operand 12683 states and 24930 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:15,923 INFO L93 Difference]: Finished difference Result 12858 states and 25280 transitions. [2022-03-01 16:54:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:15,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:15,938 INFO L225 Difference]: With dead ends: 12858 [2022-03-01 16:54:15,938 INFO L226 Difference]: Without dead ends: 12858 [2022-03-01 16:54:15,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:54:15,939 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 585 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:15,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 3092 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:54:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2022-03-01 16:54:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 12703. [2022-03-01 16:54:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12703 states, 12637 states have (on average 1.9759436575136504) internal successors, (24970), 12702 states have internal predecessors, (24970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12703 states to 12703 states and 24970 transitions. [2022-03-01 16:54:16,078 INFO L78 Accepts]: Start accepts. Automaton has 12703 states and 24970 transitions. Word has length 484 [2022-03-01 16:54:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:16,078 INFO L470 AbstractCegarLoop]: Abstraction has 12703 states and 24970 transitions. [2022-03-01 16:54:16,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 12703 states and 24970 transitions. [2022-03-01 16:54:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:16,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:16,082 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:16,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-01 16:54:16,082 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 698086230, now seen corresponding path program 3 times [2022-03-01 16:54:16,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:16,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104909688] [2022-03-01 16:54:16,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:16,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:16,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104909688] [2022-03-01 16:54:16,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104909688] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:16,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:16,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:16,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412162741] [2022-03-01 16:54:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:16,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:16,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:16,326 INFO L87 Difference]: Start difference. First operand 12703 states and 24970 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:17,450 INFO L93 Difference]: Finished difference Result 12891 states and 25346 transitions. [2022-03-01 16:54:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:17,466 INFO L225 Difference]: With dead ends: 12891 [2022-03-01 16:54:17,466 INFO L226 Difference]: Without dead ends: 12891 [2022-03-01 16:54:17,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:17,467 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 578 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:17,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 2818 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:54:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2022-03-01 16:54:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 12704. [2022-03-01 16:54:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12704 states, 12638 states have (on average 1.9759455610064884) internal successors, (24972), 12703 states have internal predecessors, (24972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12704 states to 12704 states and 24972 transitions. [2022-03-01 16:54:17,654 INFO L78 Accepts]: Start accepts. Automaton has 12704 states and 24972 transitions. Word has length 484 [2022-03-01 16:54:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:17,654 INFO L470 AbstractCegarLoop]: Abstraction has 12704 states and 24972 transitions. [2022-03-01 16:54:17,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12704 states and 24972 transitions. [2022-03-01 16:54:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:17,657 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:17,657 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:17,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-01 16:54:17,657 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash -131444940, now seen corresponding path program 4 times [2022-03-01 16:54:17,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:17,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192005947] [2022-03-01 16:54:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:17,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:17,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192005947] [2022-03-01 16:54:17,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192005947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:17,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:17,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:17,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92607033] [2022-03-01 16:54:17,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:17,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:17,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:17,904 INFO L87 Difference]: Start difference. First operand 12704 states and 24972 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:19,255 INFO L93 Difference]: Finished difference Result 12912 states and 25388 transitions. [2022-03-01 16:54:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:19,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:19,270 INFO L225 Difference]: With dead ends: 12912 [2022-03-01 16:54:19,270 INFO L226 Difference]: Without dead ends: 12912 [2022-03-01 16:54:19,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:54:19,271 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 601 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:19,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3300 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-03-01 16:54:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 12723. [2022-03-01 16:54:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12723 states, 12657 states have (on average 1.9759816702220114) internal successors, (25010), 12722 states have internal predecessors, (25010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12723 states to 12723 states and 25010 transitions. [2022-03-01 16:54:19,412 INFO L78 Accepts]: Start accepts. Automaton has 12723 states and 25010 transitions. Word has length 484 [2022-03-01 16:54:19,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:19,413 INFO L470 AbstractCegarLoop]: Abstraction has 12723 states and 25010 transitions. [2022-03-01 16:54:19,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12723 states and 25010 transitions. [2022-03-01 16:54:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:19,415 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:19,416 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:19,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-01 16:54:19,416 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1589475738, now seen corresponding path program 5 times [2022-03-01 16:54:19,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:19,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412686262] [2022-03-01 16:54:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:19,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:19,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412686262] [2022-03-01 16:54:19,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412686262] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:19,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:19,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:19,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458510898] [2022-03-01 16:54:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:19,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:19,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:19,646 INFO L87 Difference]: Start difference. First operand 12723 states and 25010 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:20,592 INFO L93 Difference]: Finished difference Result 12970 states and 25504 transitions. [2022-03-01 16:54:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 16:54:20,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:20,608 INFO L225 Difference]: With dead ends: 12970 [2022-03-01 16:54:20,609 INFO L226 Difference]: Without dead ends: 12970 [2022-03-01 16:54:20,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:54:20,609 INFO L933 BasicCegarLoop]: 580 mSDtfsCounter, 613 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:20,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 2440 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2022-03-01 16:54:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12743. [2022-03-01 16:54:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12743 states, 12677 states have (on average 1.9760195629880886) internal successors, (25050), 12742 states have internal predecessors, (25050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12743 states to 12743 states and 25050 transitions. [2022-03-01 16:54:20,754 INFO L78 Accepts]: Start accepts. Automaton has 12743 states and 25050 transitions. Word has length 484 [2022-03-01 16:54:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:20,754 INFO L470 AbstractCegarLoop]: Abstraction has 12743 states and 25050 transitions. [2022-03-01 16:54:20,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 12743 states and 25050 transitions. [2022-03-01 16:54:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:20,757 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:20,757 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:20,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-01 16:54:20,758 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -372395052, now seen corresponding path program 6 times [2022-03-01 16:54:20,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:20,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285725985] [2022-03-01 16:54:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:21,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:21,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285725985] [2022-03-01 16:54:21,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285725985] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:21,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:21,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:21,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876799563] [2022-03-01 16:54:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:21,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:21,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:21,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:21,056 INFO L87 Difference]: Start difference. First operand 12743 states and 25050 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:22,350 INFO L93 Difference]: Finished difference Result 13201 states and 25966 transitions. [2022-03-01 16:54:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:54:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:22,372 INFO L225 Difference]: With dead ends: 13201 [2022-03-01 16:54:22,372 INFO L226 Difference]: Without dead ends: 13201 [2022-03-01 16:54:22,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2022-03-01 16:54:22,373 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 722 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:22,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 3462 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:54:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states. [2022-03-01 16:54:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 12755. [2022-03-01 16:54:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12755 states, 12689 states have (on average 1.976042241311372) internal successors, (25074), 12754 states have internal predecessors, (25074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 25074 transitions. [2022-03-01 16:54:22,527 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 25074 transitions. Word has length 484 [2022-03-01 16:54:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:22,527 INFO L470 AbstractCegarLoop]: Abstraction has 12755 states and 25074 transitions. [2022-03-01 16:54:22,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 25074 transitions. [2022-03-01 16:54:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:22,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:22,530 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:22,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-01 16:54:22,530 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -283118668, now seen corresponding path program 7 times [2022-03-01 16:54:22,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:22,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776131895] [2022-03-01 16:54:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:22,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:22,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776131895] [2022-03-01 16:54:22,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776131895] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:22,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:22,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:22,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798574862] [2022-03-01 16:54:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:22,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:22,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:22,796 INFO L87 Difference]: Start difference. First operand 12755 states and 25074 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:24,257 INFO L93 Difference]: Finished difference Result 23707 states and 46979 transitions. [2022-03-01 16:54:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 16:54:24,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:24,290 INFO L225 Difference]: With dead ends: 23707 [2022-03-01 16:54:24,290 INFO L226 Difference]: Without dead ends: 23707 [2022-03-01 16:54:24,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2022-03-01 16:54:24,291 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 1339 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:24,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1339 Valid, 4354 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23707 states. [2022-03-01 16:54:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23707 to 12962. [2022-03-01 16:54:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12896 states have (on average 1.9764267990074442) internal successors, (25488), 12961 states have internal predecessors, (25488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 25488 transitions. [2022-03-01 16:54:24,504 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 25488 transitions. Word has length 484 [2022-03-01 16:54:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:24,505 INFO L470 AbstractCegarLoop]: Abstraction has 12962 states and 25488 transitions. [2022-03-01 16:54:24,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 25488 transitions. [2022-03-01 16:54:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:24,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:24,508 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:24,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-01 16:54:24,509 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:24,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:24,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2091267574, now seen corresponding path program 1 times [2022-03-01 16:54:24,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:24,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141218950] [2022-03-01 16:54:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:24,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:24,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:24,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141218950] [2022-03-01 16:54:24,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141218950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:24,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:24,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:24,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262548541] [2022-03-01 16:54:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:24,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:24,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:24,832 INFO L87 Difference]: Start difference. First operand 12962 states and 25488 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:26,390 INFO L93 Difference]: Finished difference Result 23598 states and 46761 transitions. [2022-03-01 16:54:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:54:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:26,428 INFO L225 Difference]: With dead ends: 23598 [2022-03-01 16:54:26,428 INFO L226 Difference]: Without dead ends: 23598 [2022-03-01 16:54:26,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:54:26,429 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1413 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:26,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1413 Valid, 3998 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2022-03-01 16:54:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 12954. [2022-03-01 16:54:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12954 states, 12889 states have (on average 1.9762588253549538) internal successors, (25472), 12953 states have internal predecessors, (25472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 25472 transitions. [2022-03-01 16:54:26,646 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 25472 transitions. Word has length 484 [2022-03-01 16:54:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:26,646 INFO L470 AbstractCegarLoop]: Abstraction has 12954 states and 25472 transitions. [2022-03-01 16:54:26,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 25472 transitions. [2022-03-01 16:54:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:26,650 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:26,650 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:26,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-01 16:54:26,650 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash -750198022, now seen corresponding path program 2 times [2022-03-01 16:54:26,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:26,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545505240] [2022-03-01 16:54:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:26,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:26,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545505240] [2022-03-01 16:54:26,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545505240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:26,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:26,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:26,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134814925] [2022-03-01 16:54:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:26,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:26,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:26,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:26,883 INFO L87 Difference]: Start difference. First operand 12954 states and 25472 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:28,273 INFO L93 Difference]: Finished difference Result 24018 states and 47600 transitions. [2022-03-01 16:54:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:54:28,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:28,315 INFO L225 Difference]: With dead ends: 24018 [2022-03-01 16:54:28,316 INFO L226 Difference]: Without dead ends: 24018 [2022-03-01 16:54:28,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:54:28,316 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 913 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 2685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:28,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 4241 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-03-01 16:54:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 13195. [2022-03-01 16:54:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13195 states, 13130 states have (on average 1.9766945925361767) internal successors, (25954), 13194 states have internal predecessors, (25954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 25954 transitions. [2022-03-01 16:54:28,534 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 25954 transitions. Word has length 484 [2022-03-01 16:54:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:28,534 INFO L470 AbstractCegarLoop]: Abstraction has 13195 states and 25954 transitions. [2022-03-01 16:54:28,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 25954 transitions. [2022-03-01 16:54:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:28,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:28,537 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:28,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-01 16:54:28,537 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1102524194, now seen corresponding path program 3 times [2022-03-01 16:54:28,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:28,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844068024] [2022-03-01 16:54:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:28,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:28,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844068024] [2022-03-01 16:54:28,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844068024] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:28,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:28,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:28,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650140332] [2022-03-01 16:54:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:28,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:28,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:28,887 INFO L87 Difference]: Start difference. First operand 13195 states and 25954 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:29,755 INFO L93 Difference]: Finished difference Result 13507 states and 26578 transitions. [2022-03-01 16:54:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:54:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:29,774 INFO L225 Difference]: With dead ends: 13507 [2022-03-01 16:54:29,774 INFO L226 Difference]: Without dead ends: 13507 [2022-03-01 16:54:29,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:54:29,774 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 304 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:29,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 2672 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2022-03-01 16:54:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 13199. [2022-03-01 16:54:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:54:29,940 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:54:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:29,941 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:54:29,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:54:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:29,944 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:29,944 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:29,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-01 16:54:29,944 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1981616688, now seen corresponding path program 4 times [2022-03-01 16:54:29,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:29,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978598121] [2022-03-01 16:54:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:30,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:30,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978598121] [2022-03-01 16:54:30,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978598121] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:30,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:30,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:30,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676598886] [2022-03-01 16:54:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:30,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:30,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:30,213 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:30,941 INFO L93 Difference]: Finished difference Result 13561 states and 26686 transitions. [2022-03-01 16:54:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:30,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:30,960 INFO L225 Difference]: With dead ends: 13561 [2022-03-01 16:54:30,960 INFO L226 Difference]: Without dead ends: 13561 [2022-03-01 16:54:30,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:30,961 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 333 mSDsluCounter, 1837 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:30,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 2252 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:54:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13561 states. [2022-03-01 16:54:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13561 to 13199. [2022-03-01 16:54:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:54:31,131 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:54:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:31,131 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:54:31,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:54:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:31,135 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:31,135 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:31,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-01 16:54:31,135 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash 24019584, now seen corresponding path program 5 times [2022-03-01 16:54:31,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:31,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125991345] [2022-03-01 16:54:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:31,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:31,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125991345] [2022-03-01 16:54:31,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125991345] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:31,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:31,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:31,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778865853] [2022-03-01 16:54:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:31,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:31,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:31,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:31,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:31,406 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:32,506 INFO L93 Difference]: Finished difference Result 13609 states and 26782 transitions. [2022-03-01 16:54:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:32,521 INFO L225 Difference]: With dead ends: 13609 [2022-03-01 16:54:32,521 INFO L226 Difference]: Without dead ends: 13609 [2022-03-01 16:54:32,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:32,522 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 332 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2810 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:32,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 2810 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2022-03-01 16:54:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13199. [2022-03-01 16:54:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:54:32,672 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:54:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:32,672 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:54:32,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:54:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:32,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:32,676 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:32,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-01 16:54:32,676 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash 212754002, now seen corresponding path program 6 times [2022-03-01 16:54:32,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:32,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103364630] [2022-03-01 16:54:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:32,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:32,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103364630] [2022-03-01 16:54:32,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103364630] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:32,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:32,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:32,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841903636] [2022-03-01 16:54:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:32,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:32,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:32,916 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:33,665 INFO L93 Difference]: Finished difference Result 13663 states and 26890 transitions. [2022-03-01 16:54:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:33,683 INFO L225 Difference]: With dead ends: 13663 [2022-03-01 16:54:33,683 INFO L226 Difference]: Without dead ends: 13663 [2022-03-01 16:54:33,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:33,684 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 360 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:33,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 2303 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:54:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13663 states. [2022-03-01 16:54:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13663 to 13199. [2022-03-01 16:54:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13199 states, 13134 states have (on average 1.9767016902695294) internal successors, (25962), 13198 states have internal predecessors, (25962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13199 states to 13199 states and 25962 transitions. [2022-03-01 16:54:33,840 INFO L78 Accepts]: Start accepts. Automaton has 13199 states and 25962 transitions. Word has length 484 [2022-03-01 16:54:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:33,840 INFO L470 AbstractCegarLoop]: Abstraction has 13199 states and 25962 transitions. [2022-03-01 16:54:33,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 13199 states and 25962 transitions. [2022-03-01 16:54:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:33,843 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:33,844 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:33,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-01 16:54:33,844 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1227423530, now seen corresponding path program 8 times [2022-03-01 16:54:33,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:33,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962390616] [2022-03-01 16:54:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:34,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:34,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962390616] [2022-03-01 16:54:34,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962390616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:34,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:34,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:34,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551151362] [2022-03-01 16:54:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:34,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:34,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:34,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:34,100 INFO L87 Difference]: Start difference. First operand 13199 states and 25962 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:35,549 INFO L93 Difference]: Finished difference Result 23784 states and 47132 transitions. [2022-03-01 16:54:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:35,582 INFO L225 Difference]: With dead ends: 23784 [2022-03-01 16:54:35,583 INFO L226 Difference]: Without dead ends: 23784 [2022-03-01 16:54:35,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:54:35,583 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 765 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:35,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 4807 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2936 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:54:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23784 states. [2022-03-01 16:54:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23784 to 12971. [2022-03-01 16:54:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:54:35,873 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:54:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:35,874 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:54:35,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:54:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:35,877 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:35,877 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:35,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-01 16:54:35,877 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2081387342, now seen corresponding path program 7 times [2022-03-01 16:54:35,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:35,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475591364] [2022-03-01 16:54:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:36,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:36,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475591364] [2022-03-01 16:54:36,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475591364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:36,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:36,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:36,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819157381] [2022-03-01 16:54:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:36,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:36,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:36,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:36,142 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:37,688 INFO L93 Difference]: Finished difference Result 23965 states and 47494 transitions. [2022-03-01 16:54:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-01 16:54:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:37,724 INFO L225 Difference]: With dead ends: 23965 [2022-03-01 16:54:37,724 INFO L226 Difference]: Without dead ends: 23965 [2022-03-01 16:54:37,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:54:37,724 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 966 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:37,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 4774 Invalid, 3076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:54:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23965 states. [2022-03-01 16:54:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23965 to 13214. [2022-03-01 16:54:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:54:37,947 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:54:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:37,947 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:54:37,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:54:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:37,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:37,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:37,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-01 16:54:37,951 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1475024146, now seen corresponding path program 9 times [2022-03-01 16:54:37,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:37,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360034587] [2022-03-01 16:54:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:38,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:38,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360034587] [2022-03-01 16:54:38,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360034587] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:38,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:38,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:38,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744898490] [2022-03-01 16:54:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:38,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:38,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:38,173 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:39,652 INFO L93 Difference]: Finished difference Result 23857 states and 47278 transitions. [2022-03-01 16:54:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:54:39,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:39,686 INFO L225 Difference]: With dead ends: 23857 [2022-03-01 16:54:39,686 INFO L226 Difference]: Without dead ends: 23857 [2022-03-01 16:54:39,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:54:39,687 INFO L933 BasicCegarLoop]: 939 mSDtfsCounter, 816 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 3007 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:39,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 5100 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:54:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23857 states. [2022-03-01 16:54:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23857 to 12971. [2022-03-01 16:54:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12906 states have (on average 1.9762900976290099) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:54:39,958 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:54:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:39,959 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:54:39,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:54:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:39,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:39,962 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:39,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-01 16:54:39,962 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1894926820, now seen corresponding path program 8 times [2022-03-01 16:54:39,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:39,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53780098] [2022-03-01 16:54:39,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:40,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:40,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53780098] [2022-03-01 16:54:40,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53780098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:40,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:40,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:40,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034658340] [2022-03-01 16:54:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:40,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:40,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:40,226 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:41,556 INFO L93 Difference]: Finished difference Result 25380 states and 50259 transitions. [2022-03-01 16:54:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:54:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:41,593 INFO L225 Difference]: With dead ends: 25380 [2022-03-01 16:54:41,593 INFO L226 Difference]: Without dead ends: 25380 [2022-03-01 16:54:41,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2022-03-01 16:54:41,594 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1399 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:41,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1399 Valid, 4186 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:54:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-03-01 16:54:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 14569. [2022-03-01 16:54:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14569 states, 14504 states have (on average 1.993656922228351) internal successors, (28916), 14568 states have internal predecessors, (28916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14569 states to 14569 states and 28916 transitions. [2022-03-01 16:54:41,822 INFO L78 Accepts]: Start accepts. Automaton has 14569 states and 28916 transitions. Word has length 484 [2022-03-01 16:54:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:41,822 INFO L470 AbstractCegarLoop]: Abstraction has 14569 states and 28916 transitions. [2022-03-01 16:54:41,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14569 states and 28916 transitions. [2022-03-01 16:54:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:41,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:41,825 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:41,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-01 16:54:41,826 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -547318260, now seen corresponding path program 9 times [2022-03-01 16:54:41,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:41,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853401013] [2022-03-01 16:54:41,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:41,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:42,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:42,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853401013] [2022-03-01 16:54:42,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853401013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:42,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:42,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:42,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517361117] [2022-03-01 16:54:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:42,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:42,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:42,129 INFO L87 Difference]: Start difference. First operand 14569 states and 28916 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:43,058 INFO L93 Difference]: Finished difference Result 16297 states and 32307 transitions. [2022-03-01 16:54:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:54:43,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:43,079 INFO L225 Difference]: With dead ends: 16297 [2022-03-01 16:54:43,079 INFO L226 Difference]: Without dead ends: 16297 [2022-03-01 16:54:43,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:43,081 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 574 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:43,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3050 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:54:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16297 states. [2022-03-01 16:54:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16297 to 14572. [2022-03-01 16:54:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14507 states have (on average 1.9936582339560212) internal successors, (28922), 14571 states have internal predecessors, (28922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 28922 transitions. [2022-03-01 16:54:43,320 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 28922 transitions. Word has length 484 [2022-03-01 16:54:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:43,321 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 28922 transitions. [2022-03-01 16:54:43,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 28922 transitions. [2022-03-01 16:54:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:43,324 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:43,324 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:43,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-01 16:54:43,325 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 331774234, now seen corresponding path program 10 times [2022-03-01 16:54:43,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:43,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213565822] [2022-03-01 16:54:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:43,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:43,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213565822] [2022-03-01 16:54:43,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213565822] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:43,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:43,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:43,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649323395] [2022-03-01 16:54:43,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:43,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:43,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:43,608 INFO L87 Difference]: Start difference. First operand 14572 states and 28922 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:44,662 INFO L93 Difference]: Finished difference Result 16351 states and 32415 transitions. [2022-03-01 16:54:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:44,684 INFO L225 Difference]: With dead ends: 16351 [2022-03-01 16:54:44,685 INFO L226 Difference]: Without dead ends: 16351 [2022-03-01 16:54:44,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:54:44,685 INFO L933 BasicCegarLoop]: 621 mSDtfsCounter, 601 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 3454 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:44,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 3454 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16351 states. [2022-03-01 16:54:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16351 to 14571. [2022-03-01 16:54:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14571 states, 14506 states have (on average 1.9936577967737488) internal successors, (28920), 14570 states have internal predecessors, (28920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14571 states to 14571 states and 28920 transitions. [2022-03-01 16:54:44,870 INFO L78 Accepts]: Start accepts. Automaton has 14571 states and 28920 transitions. Word has length 484 [2022-03-01 16:54:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:44,870 INFO L470 AbstractCegarLoop]: Abstraction has 14571 states and 28920 transitions. [2022-03-01 16:54:44,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14571 states and 28920 transitions. [2022-03-01 16:54:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:44,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:44,874 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:44,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-01 16:54:44,874 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:44,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1625822870, now seen corresponding path program 11 times [2022-03-01 16:54:44,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:44,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084763965] [2022-03-01 16:54:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:45,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:45,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084763965] [2022-03-01 16:54:45,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084763965] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:45,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:45,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:45,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845722722] [2022-03-01 16:54:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:45,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:45,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:45,137 INFO L87 Difference]: Start difference. First operand 14571 states and 28920 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:45,966 INFO L93 Difference]: Finished difference Result 16399 states and 32511 transitions. [2022-03-01 16:54:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:54:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:45,988 INFO L225 Difference]: With dead ends: 16399 [2022-03-01 16:54:45,988 INFO L226 Difference]: Without dead ends: 16399 [2022-03-01 16:54:45,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:54:45,989 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 616 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:45,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 2788 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2022-03-01 16:54:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 14570. [2022-03-01 16:54:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-01 16:54:46,273 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-01 16:54:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:46,273 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-01 16:54:46,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-01 16:54:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:46,276 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:46,276 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:46,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-01 16:54:46,277 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1437088452, now seen corresponding path program 12 times [2022-03-01 16:54:46,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:46,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449510717] [2022-03-01 16:54:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:46,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:46,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449510717] [2022-03-01 16:54:46,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449510717] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:46,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:46,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:46,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476968183] [2022-03-01 16:54:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:46,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:46,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:46,511 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:47,362 INFO L93 Difference]: Finished difference Result 16449 states and 32611 transitions. [2022-03-01 16:54:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-01 16:54:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:47,383 INFO L225 Difference]: With dead ends: 16449 [2022-03-01 16:54:47,383 INFO L226 Difference]: Without dead ends: 16449 [2022-03-01 16:54:47,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:54:47,384 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 629 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:47,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 2795 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-01 16:54:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16449 states. [2022-03-01 16:54:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16449 to 14570. [2022-03-01 16:54:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14570 states, 14505 states have (on average 1.9936573595311962) internal successors, (28918), 14569 states have internal predecessors, (28918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 28918 transitions. [2022-03-01 16:54:47,560 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 28918 transitions. Word has length 484 [2022-03-01 16:54:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:47,561 INFO L470 AbstractCegarLoop]: Abstraction has 14570 states and 28918 transitions. [2022-03-01 16:54:47,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 28918 transitions. [2022-03-01 16:54:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:47,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:47,564 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:47,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-03-01 16:54:47,564 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:47,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash 228339840, now seen corresponding path program 13 times [2022-03-01 16:54:47,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:47,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195654076] [2022-03-01 16:54:47,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:47,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:47,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195654076] [2022-03-01 16:54:47,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195654076] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:47,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:47,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:47,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090201234] [2022-03-01 16:54:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:47,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:47,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:47,890 INFO L87 Difference]: Start difference. First operand 14570 states and 28918 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:49,436 INFO L93 Difference]: Finished difference Result 16314 states and 32340 transitions. [2022-03-01 16:54:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:54:49,436 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:49,457 INFO L225 Difference]: With dead ends: 16314 [2022-03-01 16:54:49,458 INFO L226 Difference]: Without dead ends: 16314 [2022-03-01 16:54:49,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-03-01 16:54:49,458 INFO L933 BasicCegarLoop]: 730 mSDtfsCounter, 722 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:49,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 4009 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:54:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2022-03-01 16:54:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 14555. [2022-03-01 16:54:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14555 states, 14490 states have (on average 1.9935127674258108) internal successors, (28886), 14554 states have internal predecessors, (28886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 28886 transitions. [2022-03-01 16:54:49,732 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 28886 transitions. Word has length 484 [2022-03-01 16:54:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:49,732 INFO L470 AbstractCegarLoop]: Abstraction has 14555 states and 28886 transitions. [2022-03-01 16:54:49,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 28886 transitions. [2022-03-01 16:54:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:49,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:49,737 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:49,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-03-01 16:54:49,737 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1334381400, now seen corresponding path program 14 times [2022-03-01 16:54:49,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:49,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696856034] [2022-03-01 16:54:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:49,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:49,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:49,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696856034] [2022-03-01 16:54:49,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696856034] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:49,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:49,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:49,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828249812] [2022-03-01 16:54:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:49,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:49,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:49,994 INFO L87 Difference]: Start difference. First operand 14555 states and 28886 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:51,672 INFO L93 Difference]: Finished difference Result 16306 states and 32322 transitions. [2022-03-01 16:54:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:54:51,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:51,696 INFO L225 Difference]: With dead ends: 16306 [2022-03-01 16:54:51,696 INFO L226 Difference]: Without dead ends: 16306 [2022-03-01 16:54:51,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-01 16:54:51,696 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 721 mSDsluCounter, 3367 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:51,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 4098 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3163 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-01 16:54:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16306 states. [2022-03-01 16:54:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16306 to 14556. [2022-03-01 16:54:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14556 states, 14491 states have (on average 1.993513215099027) internal successors, (28888), 14555 states have internal predecessors, (28888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14556 states to 14556 states and 28888 transitions. [2022-03-01 16:54:51,890 INFO L78 Accepts]: Start accepts. Automaton has 14556 states and 28888 transitions. Word has length 484 [2022-03-01 16:54:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:51,890 INFO L470 AbstractCegarLoop]: Abstraction has 14556 states and 28888 transitions. [2022-03-01 16:54:51,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 14556 states and 28888 transitions. [2022-03-01 16:54:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:51,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:51,894 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:51,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-03-01 16:54:51,894 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2081493402, now seen corresponding path program 15 times [2022-03-01 16:54:51,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:51,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122171782] [2022-03-01 16:54:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:52,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:52,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122171782] [2022-03-01 16:54:52,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122171782] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:52,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:52,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:52,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324259101] [2022-03-01 16:54:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:52,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:52,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:52,168 INFO L87 Difference]: Start difference. First operand 14556 states and 28888 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:53,950 INFO L93 Difference]: Finished difference Result 16359 states and 32428 transitions. [2022-03-01 16:54:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:53,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:53,979 INFO L225 Difference]: With dead ends: 16359 [2022-03-01 16:54:53,980 INFO L226 Difference]: Without dead ends: 16359 [2022-03-01 16:54:53,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:54:53,980 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 734 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:53,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 4291 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-01 16:54:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16359 states. [2022-03-01 16:54:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16359 to 14540. [2022-03-01 16:54:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14540 states, 14475 states have (on average 1.9933678756476685) internal successors, (28854), 14539 states have internal predecessors, (28854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14540 states to 14540 states and 28854 transitions. [2022-03-01 16:54:54,224 INFO L78 Accepts]: Start accepts. Automaton has 14540 states and 28854 transitions. Word has length 484 [2022-03-01 16:54:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:54,225 INFO L470 AbstractCegarLoop]: Abstraction has 14540 states and 28854 transitions. [2022-03-01 16:54:54,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 14540 states and 28854 transitions. [2022-03-01 16:54:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:54,228 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:54,228 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:54,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-03-01 16:54:54,228 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2006633890, now seen corresponding path program 16 times [2022-03-01 16:54:54,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:54,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424563184] [2022-03-01 16:54:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:54,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:54,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424563184] [2022-03-01 16:54:54,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424563184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:54,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:54,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:54,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524912668] [2022-03-01 16:54:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:54,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:54,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:54,484 INFO L87 Difference]: Start difference. First operand 14540 states and 28854 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:55,526 INFO L93 Difference]: Finished difference Result 16300 states and 32309 transitions. [2022-03-01 16:54:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:54:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:55,549 INFO L225 Difference]: With dead ends: 16300 [2022-03-01 16:54:55,550 INFO L226 Difference]: Without dead ends: 16300 [2022-03-01 16:54:55,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:54:55,550 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 659 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:55,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 2864 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:54:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16300 states. [2022-03-01 16:54:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16300 to 14542. [2022-03-01 16:54:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14477 states have (on average 1.99336879187677) internal successors, (28858), 14541 states have internal predecessors, (28858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 28858 transitions. [2022-03-01 16:54:55,741 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 28858 transitions. Word has length 484 [2022-03-01 16:54:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:55,741 INFO L470 AbstractCegarLoop]: Abstraction has 14542 states and 28858 transitions. [2022-03-01 16:54:55,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 28858 transitions. [2022-03-01 16:54:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:55,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:55,745 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:55,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-03-01 16:54:55,745 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1409240912, now seen corresponding path program 17 times [2022-03-01 16:54:55,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:55,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708890823] [2022-03-01 16:54:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:55,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:55,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708890823] [2022-03-01 16:54:55,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708890823] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:55,994 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:55,994 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:55,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120422640] [2022-03-01 16:54:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:55,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:55,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:55,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:55,995 INFO L87 Difference]: Start difference. First operand 14542 states and 28858 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:57,318 INFO L93 Difference]: Finished difference Result 16358 states and 32425 transitions. [2022-03-01 16:54:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:54:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:57,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:57,340 INFO L225 Difference]: With dead ends: 16358 [2022-03-01 16:54:57,340 INFO L226 Difference]: Without dead ends: 16358 [2022-03-01 16:54:57,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:54:57,340 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 664 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:57,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 3416 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:54:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-03-01 16:54:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 14541. [2022-03-01 16:54:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14541 states, 14476 states have (on average 1.9933683337938657) internal successors, (28856), 14540 states have internal predecessors, (28856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 28856 transitions. [2022-03-01 16:54:57,564 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 28856 transitions. Word has length 484 [2022-03-01 16:54:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:57,564 INFO L470 AbstractCegarLoop]: Abstraction has 14541 states and 28856 transitions. [2022-03-01 16:54:57,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 28856 transitions. [2022-03-01 16:54:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:57,569 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:57,569 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:57,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-03-01 16:54:57,569 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 928129280, now seen corresponding path program 18 times [2022-03-01 16:54:57,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:57,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988504471] [2022-03-01 16:54:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:57,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:57,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988504471] [2022-03-01 16:54:57,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988504471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:57,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:57,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:57,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818729237] [2022-03-01 16:54:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:57,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:57,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:57,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:57,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:57,876 INFO L87 Difference]: Start difference. First operand 14541 states and 28856 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:54:59,421 INFO L93 Difference]: Finished difference Result 16443 states and 32595 transitions. [2022-03-01 16:54:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:54:59,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:54:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:54:59,441 INFO L225 Difference]: With dead ends: 16443 [2022-03-01 16:54:59,442 INFO L226 Difference]: Without dead ends: 16443 [2022-03-01 16:54:59,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:54:59,442 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 675 mSDsluCounter, 3204 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:54:59,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 3881 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:54:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16443 states. [2022-03-01 16:54:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16443 to 13214. [2022-03-01 16:54:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:54:59,604 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:54:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:54:59,604 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:54:59,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:54:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:54:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:54:59,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:54:59,607 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:54:59,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-03-01 16:54:59,608 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:54:59,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:54:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1312401738, now seen corresponding path program 19 times [2022-03-01 16:54:59,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:54:59,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252060120] [2022-03-01 16:54:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:54:59,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:54:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:54:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:54:59,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:54:59,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252060120] [2022-03-01 16:54:59,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252060120] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:54:59,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:54:59,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:54:59,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864538620] [2022-03-01 16:54:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:54:59,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:54:59,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:54:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:54:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:54:59,908 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:01,218 INFO L93 Difference]: Finished difference Result 14947 states and 29393 transitions. [2022-03-01 16:55:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-01 16:55:01,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:01,238 INFO L225 Difference]: With dead ends: 14947 [2022-03-01 16:55:01,238 INFO L226 Difference]: Without dead ends: 14947 [2022-03-01 16:55:01,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:55:01,238 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 572 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3553 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:01,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 3553 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:55:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-03-01 16:55:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 13217. [2022-03-01 16:55:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13217 states, 13152 states have (on average 1.9767335766423357) internal successors, (25998), 13216 states have internal predecessors, (25998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13217 states to 13217 states and 25998 transitions. [2022-03-01 16:55:01,441 INFO L78 Accepts]: Start accepts. Automaton has 13217 states and 25998 transitions. Word has length 484 [2022-03-01 16:55:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:01,441 INFO L470 AbstractCegarLoop]: Abstraction has 13217 states and 25998 transitions. [2022-03-01 16:55:01,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 13217 states and 25998 transitions. [2022-03-01 16:55:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:01,445 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:01,445 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:01,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-03-01 16:55:01,445 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -433309244, now seen corresponding path program 20 times [2022-03-01 16:55:01,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:01,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512851757] [2022-03-01 16:55:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:01,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:01,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512851757] [2022-03-01 16:55:01,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512851757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:01,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:01,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:01,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254210071] [2022-03-01 16:55:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:01,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:01,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:01,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:01,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:01,694 INFO L87 Difference]: Start difference. First operand 13217 states and 25998 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:02,700 INFO L93 Difference]: Finished difference Result 15001 states and 29501 transitions. [2022-03-01 16:55:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:02,719 INFO L225 Difference]: With dead ends: 15001 [2022-03-01 16:55:02,720 INFO L226 Difference]: Without dead ends: 15001 [2022-03-01 16:55:02,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-03-01 16:55:02,720 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 589 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:02,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2837 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:55:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15001 states. [2022-03-01 16:55:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15001 to 13216. [2022-03-01 16:55:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13216 states, 13151 states have (on average 1.9767318074671127) internal successors, (25996), 13215 states have internal predecessors, (25996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13216 states to 13216 states and 25996 transitions. [2022-03-01 16:55:02,879 INFO L78 Accepts]: Start accepts. Automaton has 13216 states and 25996 transitions. Word has length 484 [2022-03-01 16:55:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:02,880 INFO L470 AbstractCegarLoop]: Abstraction has 13216 states and 25996 transitions. [2022-03-01 16:55:02,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13216 states and 25996 transitions. [2022-03-01 16:55:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:02,883 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:02,883 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:02,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-03-01 16:55:02,883 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1904060948, now seen corresponding path program 21 times [2022-03-01 16:55:02,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:02,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64457840] [2022-03-01 16:55:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:03,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:03,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64457840] [2022-03-01 16:55:03,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64457840] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:03,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:03,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:03,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715738078] [2022-03-01 16:55:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:03,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:03,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:03,131 INFO L87 Difference]: Start difference. First operand 13216 states and 25996 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:04,145 INFO L93 Difference]: Finished difference Result 15052 states and 29603 transitions. [2022-03-01 16:55:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:04,166 INFO L225 Difference]: With dead ends: 15052 [2022-03-01 16:55:04,166 INFO L226 Difference]: Without dead ends: 15052 [2022-03-01 16:55:04,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2022-03-01 16:55:04,167 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 602 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2695 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:04,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 2695 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-01 16:55:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15052 states. [2022-03-01 16:55:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15052 to 13215. [2022-03-01 16:55:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13150 states have (on average 1.9767300380228137) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-01 16:55:04,425 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-01 16:55:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:04,426 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-01 16:55:04,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-01 16:55:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:04,429 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:04,429 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:04,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-03-01 16:55:04,429 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2092795366, now seen corresponding path program 22 times [2022-03-01 16:55:04,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:04,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64559513] [2022-03-01 16:55:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:04,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:04,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64559513] [2022-03-01 16:55:04,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64559513] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:04,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:04,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:04,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000941542] [2022-03-01 16:55:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:04,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:04,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:04,674 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:06,018 INFO L93 Difference]: Finished difference Result 15095 states and 29689 transitions. [2022-03-01 16:55:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:06,040 INFO L225 Difference]: With dead ends: 15095 [2022-03-01 16:55:06,041 INFO L226 Difference]: Without dead ends: 15095 [2022-03-01 16:55:06,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:55:06,041 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 623 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:06,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 3466 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:55:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2022-03-01 16:55:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 13214. [2022-03-01 16:55:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13149 states have (on average 1.9767282683093772) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:06,212 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:06,212 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:06,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:06,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:06,216 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:06,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-03-01 16:55:06,216 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 418435456, now seen corresponding path program 10 times [2022-03-01 16:55:06,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:06,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576822475] [2022-03-01 16:55:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:06,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:06,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576822475] [2022-03-01 16:55:06,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576822475] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:06,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:06,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:06,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383051769] [2022-03-01 16:55:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:06,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:06,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:06,447 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:08,079 INFO L93 Difference]: Finished difference Result 25238 states and 49975 transitions. [2022-03-01 16:55:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 16:55:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:08,118 INFO L225 Difference]: With dead ends: 25238 [2022-03-01 16:55:08,118 INFO L226 Difference]: Without dead ends: 25238 [2022-03-01 16:55:08,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2022-03-01 16:55:08,119 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1188 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:08,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1188 Valid, 5500 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:55:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25238 states. [2022-03-01 16:55:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25238 to 12987. [2022-03-01 16:55:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12923 states have (on average 1.976166524800743) internal successors, (25538), 12986 states have internal predecessors, (25538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 25538 transitions. [2022-03-01 16:55:08,402 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 25538 transitions. Word has length 484 [2022-03-01 16:55:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:08,403 INFO L470 AbstractCegarLoop]: Abstraction has 12987 states and 25538 transitions. [2022-03-01 16:55:08,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 25538 transitions. [2022-03-01 16:55:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:08,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:08,407 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:08,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-03-01 16:55:08,407 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -39862168, now seen corresponding path program 23 times [2022-03-01 16:55:08,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:08,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666234702] [2022-03-01 16:55:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:08,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:08,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666234702] [2022-03-01 16:55:08,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666234702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:08,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:08,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:08,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337714178] [2022-03-01 16:55:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:08,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:08,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:08,640 INFO L87 Difference]: Start difference. First operand 12987 states and 25538 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:09,789 INFO L93 Difference]: Finished difference Result 24029 states and 47620 transitions. [2022-03-01 16:55:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-01 16:55:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:09,822 INFO L225 Difference]: With dead ends: 24029 [2022-03-01 16:55:09,822 INFO L226 Difference]: Without dead ends: 24029 [2022-03-01 16:55:09,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-03-01 16:55:09,822 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 1045 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 4040 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:09,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 4040 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:55:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2022-03-01 16:55:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 13215. [2022-03-01 16:55:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13215 states, 13151 states have (on average 1.9765797277773554) internal successors, (25994), 13214 states have internal predecessors, (25994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13215 states to 13215 states and 25994 transitions. [2022-03-01 16:55:10,033 INFO L78 Accepts]: Start accepts. Automaton has 13215 states and 25994 transitions. Word has length 484 [2022-03-01 16:55:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:10,033 INFO L470 AbstractCegarLoop]: Abstraction has 13215 states and 25994 transitions. [2022-03-01 16:55:10,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13215 states and 25994 transitions. [2022-03-01 16:55:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:10,036 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:10,037 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:10,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-03-01 16:55:10,037 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1812860048, now seen corresponding path program 24 times [2022-03-01 16:55:10,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:10,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476200045] [2022-03-01 16:55:10,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:10,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:10,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:10,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476200045] [2022-03-01 16:55:10,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476200045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:10,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:10,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:10,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396176598] [2022-03-01 16:55:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:10,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:10,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:10,294 INFO L87 Difference]: Start difference. First operand 13215 states and 25994 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:11,002 INFO L93 Difference]: Finished difference Result 13519 states and 26600 transitions. [2022-03-01 16:55:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 16:55:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:11,019 INFO L225 Difference]: With dead ends: 13519 [2022-03-01 16:55:11,019 INFO L226 Difference]: Without dead ends: 13519 [2022-03-01 16:55:11,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-01 16:55:11,019 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 282 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:11,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 2734 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:55:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13519 states. [2022-03-01 16:55:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13519 to 13214. [2022-03-01 16:55:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:11,171 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:11,171 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:11,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:11,174 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:11,174 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:11,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-03-01 16:55:11,174 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1603014754, now seen corresponding path program 25 times [2022-03-01 16:55:11,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:11,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591362635] [2022-03-01 16:55:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:11,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:11,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591362635] [2022-03-01 16:55:11,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591362635] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:11,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:11,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:11,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220597283] [2022-03-01 16:55:11,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:11,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:11,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:11,478 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:12,101 INFO L93 Difference]: Finished difference Result 13573 states and 26708 transitions. [2022-03-01 16:55:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 16:55:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:12,119 INFO L225 Difference]: With dead ends: 13573 [2022-03-01 16:55:12,120 INFO L226 Difference]: Without dead ends: 13573 [2022-03-01 16:55:12,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 16:55:12,120 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 300 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:12,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 2444 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:55:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13573 states. [2022-03-01 16:55:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13573 to 13214. [2022-03-01 16:55:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:12,281 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:12,281 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:12,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:12,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:12,285 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:12,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-03-01 16:55:12,285 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 734355438, now seen corresponding path program 26 times [2022-03-01 16:55:12,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:12,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059287015] [2022-03-01 16:55:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:12,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:12,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059287015] [2022-03-01 16:55:12,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059287015] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:12,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:12,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:12,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108716145] [2022-03-01 16:55:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:12,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:12,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:12,526 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:13,562 INFO L93 Difference]: Finished difference Result 13621 states and 26804 transitions. [2022-03-01 16:55:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 16:55:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:13,581 INFO L225 Difference]: With dead ends: 13621 [2022-03-01 16:55:13,581 INFO L226 Difference]: Without dead ends: 13621 [2022-03-01 16:55:13,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-01 16:55:13,582 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:13,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 3333 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-01 16:55:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13621 states. [2022-03-01 16:55:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13621 to 13214. [2022-03-01 16:55:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:13,734 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:13,734 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:13,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:13,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:13,738 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:13,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-03-01 16:55:13,738 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash 923089856, now seen corresponding path program 27 times [2022-03-01 16:55:13,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:13,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177202370] [2022-03-01 16:55:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:13,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:13,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177202370] [2022-03-01 16:55:13,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177202370] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:13,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:13,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:13,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264205169] [2022-03-01 16:55:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:13,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:13,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:13,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:13,982 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:14,735 INFO L93 Difference]: Finished difference Result 13675 states and 26912 transitions. [2022-03-01 16:55:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 16:55:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:14,752 INFO L225 Difference]: With dead ends: 13675 [2022-03-01 16:55:14,753 INFO L226 Difference]: Without dead ends: 13675 [2022-03-01 16:55:14,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-03-01 16:55:14,753 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 325 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:14,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 2522 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:55:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13675 states. [2022-03-01 16:55:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13675 to 13214. [2022-03-01 16:55:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13214 states, 13150 states have (on average 1.9765779467680609) internal successors, (25992), 13213 states have internal predecessors, (25992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13214 states to 13214 states and 25992 transitions. [2022-03-01 16:55:14,907 INFO L78 Accepts]: Start accepts. Automaton has 13214 states and 25992 transitions. Word has length 484 [2022-03-01 16:55:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:14,907 INFO L470 AbstractCegarLoop]: Abstraction has 13214 states and 25992 transitions. [2022-03-01 16:55:14,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 13214 states and 25992 transitions. [2022-03-01 16:55:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:14,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:14,911 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:14,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-03-01 16:55:14,911 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:14,911 INFO L85 PathProgramCache]: Analyzing trace with hash -517087676, now seen corresponding path program 11 times [2022-03-01 16:55:14,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:14,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249509591] [2022-03-01 16:55:14,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:14,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:15,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:15,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249509591] [2022-03-01 16:55:15,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249509591] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:15,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:15,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:15,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559780330] [2022-03-01 16:55:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:15,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:15,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:15,152 INFO L87 Difference]: Start difference. First operand 13214 states and 25992 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:16,785 INFO L93 Difference]: Finished difference Result 23827 states and 47216 transitions. [2022-03-01 16:55:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-01 16:55:16,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:16,820 INFO L225 Difference]: With dead ends: 23827 [2022-03-01 16:55:16,820 INFO L226 Difference]: Without dead ends: 23827 [2022-03-01 16:55:16,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2022-03-01 16:55:16,820 INFO L933 BasicCegarLoop]: 928 mSDtfsCounter, 818 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:16,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [818 Valid, 5442 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:55:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23827 states. [2022-03-01 16:55:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23827 to 12971. [2022-03-01 16:55:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12907 states have (on average 1.9761369799333695) internal successors, (25506), 12970 states have internal predecessors, (25506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 25506 transitions. [2022-03-01 16:55:17,037 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 25506 transitions. Word has length 484 [2022-03-01 16:55:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:17,037 INFO L470 AbstractCegarLoop]: Abstraction has 12971 states and 25506 transitions. [2022-03-01 16:55:17,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 25506 transitions. [2022-03-01 16:55:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:17,040 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:17,040 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:17,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-03-01 16:55:17,040 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1371051488, now seen corresponding path program 28 times [2022-03-01 16:55:17,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:17,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404532888] [2022-03-01 16:55:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:17,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:17,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404532888] [2022-03-01 16:55:17,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404532888] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:17,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:17,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:17,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371724927] [2022-03-01 16:55:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:17,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:17,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:17,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:17,283 INFO L87 Difference]: Start difference. First operand 12971 states and 25506 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:18,638 INFO L93 Difference]: Finished difference Result 23624 states and 46810 transitions. [2022-03-01 16:55:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 16:55:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:18,671 INFO L225 Difference]: With dead ends: 23624 [2022-03-01 16:55:18,672 INFO L226 Difference]: Without dead ends: 23624 [2022-03-01 16:55:18,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-03-01 16:55:18,672 INFO L933 BasicCegarLoop]: 840 mSDtfsCounter, 1007 mSDsluCounter, 3571 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 4411 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:18,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 4411 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-01 16:55:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2022-03-01 16:55:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 12875. [2022-03-01 16:55:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 12812 states have (on average 1.9758039338120512) internal successors, (25314), 12874 states have internal predecessors, (25314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 25314 transitions. [2022-03-01 16:55:18,890 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 25314 transitions. Word has length 484 [2022-03-01 16:55:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:18,890 INFO L470 AbstractCegarLoop]: Abstraction has 12875 states and 25314 transitions. [2022-03-01 16:55:18,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 25314 transitions. [2022-03-01 16:55:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2022-03-01 16:55:18,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:18,894 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:18,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-03-01 16:55:18,894 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2109607296, now seen corresponding path program 12 times [2022-03-01 16:55:18,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:18,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426690671] [2022-03-01 16:55:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:19,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:19,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426690671] [2022-03-01 16:55:19,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426690671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:19,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:19,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 16:55:19,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079610288] [2022-03-01 16:55:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:19,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:55:19,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:55:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-01 16:55:19,117 INFO L87 Difference]: Start difference. First operand 12875 states and 25314 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:20,732 INFO L93 Difference]: Finished difference Result 23548 states and 46658 transitions. [2022-03-01 16:55:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-01 16:55:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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 484 [2022-03-01 16:55:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:20,764 INFO L225 Difference]: With dead ends: 23548 [2022-03-01 16:55:20,765 INFO L226 Difference]: Without dead ends: 23548 [2022-03-01 16:55:20,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-01 16:55:20,765 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 776 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:20,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 5079 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-01 16:55:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2022-03-01 16:55:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 12618. [2022-03-01 16:55:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 12555 states have (on average 1.9753086419753085) internal successors, (24800), 12617 states have internal predecessors, (24800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 24800 transitions. [2022-03-01 16:55:20,977 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 24800 transitions. Word has length 484 [2022-03-01 16:55:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:20,977 INFO L470 AbstractCegarLoop]: Abstraction has 12618 states and 24800 transitions. [2022-03-01 16:55:20,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 24800 transitions. [2022-03-01 16:55:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-01 16:55:20,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:20,981 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:20,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-03-01 16:55:20,981 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -958574857, now seen corresponding path program 1 times [2022-03-01 16:55:20,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:20,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969804706] [2022-03-01 16:55:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:21,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:21,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969804706] [2022-03-01 16:55:21,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969804706] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:21,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:21,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:21,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987434217] [2022-03-01 16:55:21,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:21,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:21,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:21,179 INFO L87 Difference]: Start difference. First operand 12618 states and 24800 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:21,552 INFO L93 Difference]: Finished difference Result 13358 states and 26280 transitions. [2022-03-01 16:55:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 488 [2022-03-01 16:55:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:21,569 INFO L225 Difference]: With dead ends: 13358 [2022-03-01 16:55:21,570 INFO L226 Difference]: Without dead ends: 13358 [2022-03-01 16:55:21,570 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-01 16:55:21,570 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 250 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:21,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 958 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:55:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13358 states. [2022-03-01 16:55:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13358 to 12928. [2022-03-01 16:55:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12928 states, 12866 states have (on average 1.9757500388621172) internal successors, (25420), 12927 states have internal predecessors, (25420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12928 states to 12928 states and 25420 transitions. [2022-03-01 16:55:21,761 INFO L78 Accepts]: Start accepts. Automaton has 12928 states and 25420 transitions. Word has length 488 [2022-03-01 16:55:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:21,761 INFO L470 AbstractCegarLoop]: Abstraction has 12928 states and 25420 transitions. [2022-03-01 16:55:21,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 12928 states and 25420 transitions. [2022-03-01 16:55:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-01 16:55:21,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:21,764 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:21,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-03-01 16:55:21,764 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1510925397, now seen corresponding path program 1 times [2022-03-01 16:55:21,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:21,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339419232] [2022-03-01 16:55:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:21,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:21,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339419232] [2022-03-01 16:55:21,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339419232] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:21,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:21,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:21,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080920439] [2022-03-01 16:55:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:21,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:21,973 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:21,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:21,974 INFO L87 Difference]: Start difference. First operand 12928 states and 25420 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:22,571 INFO L93 Difference]: Finished difference Result 13909 states and 27382 transitions. [2022-03-01 16:55:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 488 [2022-03-01 16:55:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:22,589 INFO L225 Difference]: With dead ends: 13909 [2022-03-01 16:55:22,589 INFO L226 Difference]: Without dead ends: 13909 [2022-03-01 16:55:22,589 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-01 16:55:22,590 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 317 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:22,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1271 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 16:55:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13909 states. [2022-03-01 16:55:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13909 to 13339. [2022-03-01 16:55:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13339 states, 13280 states have (on average 1.97605421686747) internal successors, (26242), 13338 states have internal predecessors, (26242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13339 states to 13339 states and 26242 transitions. [2022-03-01 16:55:22,760 INFO L78 Accepts]: Start accepts. Automaton has 13339 states and 26242 transitions. Word has length 488 [2022-03-01 16:55:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:22,761 INFO L470 AbstractCegarLoop]: Abstraction has 13339 states and 26242 transitions. [2022-03-01 16:55:22,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13339 states and 26242 transitions. [2022-03-01 16:55:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:55:22,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:22,765 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:22,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-03-01 16:55:22,765 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1249761024, now seen corresponding path program 1 times [2022-03-01 16:55:22,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:22,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514786969] [2022-03-01 16:55:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1294 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-03-01 16:55:23,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:23,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514786969] [2022-03-01 16:55:23,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514786969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:23,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545562893] [2022-03-01 16:55:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:23,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:23,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-01 16:55:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:26,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 16:55:26,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:26,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:55:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:26,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:55:26,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545562893] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:26,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:55:26,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2022-03-01 16:55:26,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495407691] [2022-03-01 16:55:26,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:26,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-01 16:55:26,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-01 16:55:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:55:26,804 INFO L87 Difference]: Start difference. First operand 13339 states and 26242 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:26,897 INFO L93 Difference]: Finished difference Result 23576 states and 46647 transitions. [2022-03-01 16:55:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-01 16:55:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-01 16:55:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:26,930 INFO L225 Difference]: With dead ends: 23576 [2022-03-01 16:55:26,930 INFO L226 Difference]: Without dead ends: 23576 [2022-03-01 16:55:26,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-01 16:55:26,931 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 445 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:26,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 867 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 16:55:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23576 states. [2022-03-01 16:55:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23576 to 13477. [2022-03-01 16:55:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13477 states, 13416 states have (on average 1.9714519976147884) internal successors, (26449), 13476 states have internal predecessors, (26449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 26449 transitions. [2022-03-01 16:55:27,142 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 26449 transitions. Word has length 494 [2022-03-01 16:55:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:27,142 INFO L470 AbstractCegarLoop]: Abstraction has 13477 states and 26449 transitions. [2022-03-01 16:55:27,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 26449 transitions. [2022-03-01 16:55:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-03-01 16:55:27,146 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:27,146 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 16:55:27,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-01 16:55:27,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:27,346 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1054999182, now seen corresponding path program 2 times [2022-03-01 16:55:27,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:27,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681394155] [2022-03-01 16:55:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:27,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 5 proven. 1342 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-03-01 16:55:28,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:28,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681394155] [2022-03-01 16:55:28,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681394155] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:28,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135960856] [2022-03-01 16:55:28,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:55:28,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:28,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:28,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-01 16:55:30,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:55:30,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:55:30,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 16:55:30,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:31,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 16:55:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:31,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:55:31,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135960856] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:31,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:55:31,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2022-03-01 16:55:31,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032052642] [2022-03-01 16:55:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:31,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-01 16:55:31,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-01 16:55:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-03-01 16:55:31,390 INFO L87 Difference]: Start difference. First operand 13477 states and 26449 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:31,543 INFO L93 Difference]: Finished difference Result 24853 states and 49037 transitions. [2022-03-01 16:55:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 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 494 [2022-03-01 16:55:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:31,579 INFO L225 Difference]: With dead ends: 24853 [2022-03-01 16:55:31,580 INFO L226 Difference]: Without dead ends: 24853 [2022-03-01 16:55:31,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-03-01 16:55:31,580 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 694 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:31,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 919 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 16:55:31,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24853 states. [2022-03-01 16:55:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24853 to 14168. [2022-03-01 16:55:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14168 states, 14103 states have (on average 1.9734808196837552) internal successors, (27832), 14167 states have internal predecessors, (27832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14168 states to 14168 states and 27832 transitions. [2022-03-01 16:55:31,805 INFO L78 Accepts]: Start accepts. Automaton has 14168 states and 27832 transitions. Word has length 494 [2022-03-01 16:55:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:31,805 INFO L470 AbstractCegarLoop]: Abstraction has 14168 states and 27832 transitions. [2022-03-01 16:55:31,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14168 states and 27832 transitions. [2022-03-01 16:55:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-01 16:55:31,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:31,808 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:31,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-01 16:55:32,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:32,008 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1941473761, now seen corresponding path program 1 times [2022-03-01 16:55:32,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:32,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273323789] [2022-03-01 16:55:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:32,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:32,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273323789] [2022-03-01 16:55:32,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273323789] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:32,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:32,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:32,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812092801] [2022-03-01 16:55:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:32,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:32,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:32,262 INFO L87 Difference]: Start difference. First operand 14168 states and 27832 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:32,697 INFO L93 Difference]: Finished difference Result 14570 states and 28636 transitions. [2022-03-01 16:55:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 497 [2022-03-01 16:55:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:32,715 INFO L225 Difference]: With dead ends: 14570 [2022-03-01 16:55:32,716 INFO L226 Difference]: Without dead ends: 14570 [2022-03-01 16:55:32,716 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-01 16:55:32,716 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 243 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:32,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 908 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:55:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14570 states. [2022-03-01 16:55:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 14477. [2022-03-01 16:55:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14477 states, 14413 states have (on average 1.9739124401581905) internal successors, (28450), 14476 states have internal predecessors, (28450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14477 states to 14477 states and 28450 transitions. [2022-03-01 16:55:32,894 INFO L78 Accepts]: Start accepts. Automaton has 14477 states and 28450 transitions. Word has length 497 [2022-03-01 16:55:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:32,894 INFO L470 AbstractCegarLoop]: Abstraction has 14477 states and 28450 transitions. [2022-03-01 16:55:32,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14477 states and 28450 transitions. [2022-03-01 16:55:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-03-01 16:55:32,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:32,897 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:32,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-03-01 16:55:32,897 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 111462508, now seen corresponding path program 1 times [2022-03-01 16:55:32,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:32,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471967800] [2022-03-01 16:55:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:33,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:33,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471967800] [2022-03-01 16:55:33,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471967800] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:33,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:33,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:33,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876140365] [2022-03-01 16:55:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:33,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:33,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:33,132 INFO L87 Difference]: Start difference. First operand 14477 states and 28450 transitions. Second operand has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:33,747 INFO L93 Difference]: Finished difference Result 15039 states and 29575 transitions. [2022-03-01 16:55:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 497 [2022-03-01 16:55:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:33,767 INFO L225 Difference]: With dead ends: 15039 [2022-03-01 16:55:33,767 INFO L226 Difference]: Without dead ends: 15039 [2022-03-01 16:55:33,767 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-01 16:55:33,767 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 313 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:33,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 1267 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 16:55:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15039 states. [2022-03-01 16:55:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15039 to 14910. [2022-03-01 16:55:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14910 states, 14847 states have (on average 1.9746076648481174) internal successors, (29317), 14909 states have internal predecessors, (29317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14910 states to 14910 states and 29317 transitions. [2022-03-01 16:55:34,010 INFO L78 Accepts]: Start accepts. Automaton has 14910 states and 29317 transitions. Word has length 497 [2022-03-01 16:55:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:34,010 INFO L470 AbstractCegarLoop]: Abstraction has 14910 states and 29317 transitions. [2022-03-01 16:55:34,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 14910 states and 29317 transitions. [2022-03-01 16:55:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-01 16:55:34,013 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:34,013 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:34,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-03-01 16:55:34,013 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:34,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1748819159, now seen corresponding path program 1 times [2022-03-01 16:55:34,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:34,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356131105] [2022-03-01 16:55:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:34,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:34,208 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:34,208 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356131105] [2022-03-01 16:55:34,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356131105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:34,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:34,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:34,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438325303] [2022-03-01 16:55:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:34,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:34,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:34,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:34,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:34,209 INFO L87 Difference]: Start difference. First operand 14910 states and 29317 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:34,712 INFO L93 Difference]: Finished difference Result 15314 states and 30125 transitions. [2022-03-01 16:55:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 505 [2022-03-01 16:55:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:34,732 INFO L225 Difference]: With dead ends: 15314 [2022-03-01 16:55:34,732 INFO L226 Difference]: Without dead ends: 15314 [2022-03-01 16:55:34,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-01 16:55:34,732 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 241 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:34,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 1207 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:55:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2022-03-01 16:55:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15218. [2022-03-01 16:55:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15218 states, 15156 states have (on average 1.974993401953022) internal successors, (29933), 15217 states have internal predecessors, (29933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15218 states to 15218 states and 29933 transitions. [2022-03-01 16:55:34,918 INFO L78 Accepts]: Start accepts. Automaton has 15218 states and 29933 transitions. Word has length 505 [2022-03-01 16:55:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:34,918 INFO L470 AbstractCegarLoop]: Abstraction has 15218 states and 29933 transitions. [2022-03-01 16:55:34,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15218 states and 29933 transitions. [2022-03-01 16:55:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2022-03-01 16:55:34,921 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:34,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:34,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-03-01 16:55:34,922 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319281, now seen corresponding path program 1 times [2022-03-01 16:55:34,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:34,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382110179] [2022-03-01 16:55:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:34,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:35,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:35,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382110179] [2022-03-01 16:55:35,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382110179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:35,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:35,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:35,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071521967] [2022-03-01 16:55:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:35,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:35,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:35,136 INFO L87 Difference]: Start difference. First operand 15218 states and 29933 transitions. Second operand has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:35,634 INFO L93 Difference]: Finished difference Result 15782 states and 31062 transitions. [2022-03-01 16:55:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:35,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 505 [2022-03-01 16:55:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:35,670 INFO L225 Difference]: With dead ends: 15782 [2022-03-01 16:55:35,670 INFO L226 Difference]: Without dead ends: 15250 [2022-03-01 16:55:35,670 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-01 16:55:35,670 INFO L933 BasicCegarLoop]: 502 mSDtfsCounter, 315 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:35,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 992 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-01 16:55:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15250 states. [2022-03-01 16:55:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15250 to 15125. [2022-03-01 16:55:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15125 states, 15064 states have (on average 1.9719861922464152) internal successors, (29706), 15124 states have internal predecessors, (29706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 29706 transitions. [2022-03-01 16:55:35,885 INFO L78 Accepts]: Start accepts. Automaton has 15125 states and 29706 transitions. Word has length 505 [2022-03-01 16:55:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:35,886 INFO L470 AbstractCegarLoop]: Abstraction has 15125 states and 29706 transitions. [2022-03-01 16:55:35,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 15125 states and 29706 transitions. [2022-03-01 16:55:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-03-01 16:55:35,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:35,889 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:35,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-03-01 16:55:35,889 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash -652155431, now seen corresponding path program 1 times [2022-03-01 16:55:35,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:35,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48797716] [2022-03-01 16:55:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:36,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:36,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48797716] [2022-03-01 16:55:36,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48797716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:36,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:36,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:36,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42228064] [2022-03-01 16:55:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:36,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:36,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:36,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:36,172 INFO L87 Difference]: Start difference. First operand 15125 states and 29706 transitions. Second operand has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:36,469 INFO L93 Difference]: Finished difference Result 15598 states and 30652 transitions. [2022-03-01 16:55:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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 521 [2022-03-01 16:55:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:36,501 INFO L225 Difference]: With dead ends: 15598 [2022-03-01 16:55:36,501 INFO L226 Difference]: Without dead ends: 15598 [2022-03-01 16:55:36,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:36,501 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 248 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:36,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 755 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 16:55:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15598 states. [2022-03-01 16:55:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 15416. [2022-03-01 16:55:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15416 states, 15358 states have (on average 1.9721317879932283) internal successors, (30288), 15415 states have internal predecessors, (30288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15416 states to 15416 states and 30288 transitions. [2022-03-01 16:55:36,721 INFO L78 Accepts]: Start accepts. Automaton has 15416 states and 30288 transitions. Word has length 521 [2022-03-01 16:55:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:36,721 INFO L470 AbstractCegarLoop]: Abstraction has 15416 states and 30288 transitions. [2022-03-01 16:55:36,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.4) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15416 states and 30288 transitions. [2022-03-01 16:55:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2022-03-01 16:55:36,724 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:36,724 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:36,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-03-01 16:55:36,725 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1159767968, now seen corresponding path program 1 times [2022-03-01 16:55:36,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:36,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413380732] [2022-03-01 16:55:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:36,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:36,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:36,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413380732] [2022-03-01 16:55:36,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413380732] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:55:36,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 16:55:36,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-01 16:55:36,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359435709] [2022-03-01 16:55:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:55:36,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 16:55:36,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:55:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 16:55:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-01 16:55:36,934 INFO L87 Difference]: Start difference. First operand 15416 states and 30288 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:55:37,253 INFO L93 Difference]: Finished difference Result 17548 states and 34524 transitions. [2022-03-01 16:55:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 16:55:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 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 531 [2022-03-01 16:55:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:55:37,287 INFO L225 Difference]: With dead ends: 17548 [2022-03-01 16:55:37,287 INFO L226 Difference]: Without dead ends: 17197 [2022-03-01 16:55:37,287 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-01 16:55:37,288 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 304 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 16:55:37,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 876 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 16:55:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17197 states. [2022-03-01 16:55:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17197 to 15413. [2022-03-01 16:55:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15413 states, 15358 states have (on average 1.963992707383774) internal successors, (30163), 15412 states have internal predecessors, (30163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 30163 transitions. [2022-03-01 16:55:37,540 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 30163 transitions. Word has length 531 [2022-03-01 16:55:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:55:37,540 INFO L470 AbstractCegarLoop]: Abstraction has 15413 states and 30163 transitions. [2022-03-01 16:55:37,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:55:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 30163 transitions. [2022-03-01 16:55:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-01 16:55:37,545 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:55:37,546 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:55:37,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-03-01 16:55:37,546 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:55:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:55:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -208741065, now seen corresponding path program 1 times [2022-03-01 16:55:37,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:55:37,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674030595] [2022-03-01 16:55:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:55:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:55:38,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:55:38,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674030595] [2022-03-01 16:55:38,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674030595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:55:38,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714910873] [2022-03-01 16:55:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:55:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:55:38,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:55:38,142 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:55:38,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-01 16:55:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:55:40,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 2247 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-01 16:55:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:55:40,989 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 16:55:40,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-03-01 16:55:41,099 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 16:55:41,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-01 16:55:41,472 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 16:55:41,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-01 16:55:41,814 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 16:55:41,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-01 16:55:42,153 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-03-01 16:55:42,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-03-01 16:55:42,458 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-01 16:55:42,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-03-01 16:55:42,965 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-01 16:55:42,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-01 16:55:43,448 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-01 16:55:43,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-01 16:55:43,899 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-01 16:55:43,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-01 16:55:44,378 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-01 16:55:44,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-01 16:55:44,841 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-03-01 16:55:44,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-03-01 16:55:45,454 INFO L353 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-03-01 16:55:45,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2022-03-01 16:55:54,683 INFO L353 Elim1Store]: treesize reduction 38, result has 48.6 percent of original size [2022-03-01 16:55:54,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 59 [2022-03-01 16:55:58,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:55:58,422 INFO L353 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-03-01 16:55:58,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-03-01 16:55:58,537 INFO L353 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-03-01 16:55:58,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 16:55:58,929 INFO L353 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-03-01 16:55:58,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 50 [2022-03-01 16:55:59,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 42 treesize of output 40 [2022-03-01 16:55:59,153 INFO L353 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-03-01 16:55:59,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 16:55:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 984 proven. 27 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2022-03-01 16:55:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:55:59,267 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| 2 .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-01 16:55:59,334 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| 2 .cse0))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((v_ArrVal_49313 (Array Int Int))) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_49313) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0))) is different from false [2022-03-01 16:55:59,766 INFO L353 Elim1Store]: treesize reduction 132, result has 22.8 percent of original size [2022-03-01 16:55:59,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 108 [2022-03-01 16:55:59,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 182 treesize of output 170 [2022-03-01 16:55:59,786 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-01 16:55:59,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 191 [2022-03-01 16:55:59,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 89 treesize of output 82 [2022-03-01 16:55:59,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 74 treesize of output 67 [2022-03-01 16:55:59,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 51 [2022-03-01 16:56:04,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:04,908 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-01 16:56:04,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2022-03-01 16:56:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2022-03-01 16:56:04,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714910873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:56:04,944 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:56:04,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 12] total 37 [2022-03-01 16:56:04,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931926703] [2022-03-01 16:56:04,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:56:04,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-01 16:56:04,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-01 16:56:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1068, Unknown=10, NotChecked=138, Total=1406 [2022-03-01 16:56:04,946 INFO L87 Difference]: Start difference. First operand 15413 states and 30163 transitions. Second operand has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:06,677 INFO L93 Difference]: Finished difference Result 17784 states and 34899 transitions. [2022-03-01 16:56:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 16:56:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 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 589 [2022-03-01 16:56:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:06,704 INFO L225 Difference]: With dead ends: 17784 [2022-03-01 16:56:06,704 INFO L226 Difference]: Without dead ends: 17784 [2022-03-01 16:56:06,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1139 SyntacticMatches, 33 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=593, Invalid=3308, Unknown=13, NotChecked=246, Total=4160 [2022-03-01 16:56:06,705 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 2234 mSDsluCounter, 6641 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 7127 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3670 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:06,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2234 Valid, 7127 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1313 Invalid, 0 Unknown, 3670 Unchecked, 0.8s Time] [2022-03-01 16:56:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17784 states. [2022-03-01 16:56:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17784 to 17146. [2022-03-01 16:56:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17146 states, 17091 states have (on average 1.9676437891287812) internal successors, (33629), 17145 states have internal predecessors, (33629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 33629 transitions. [2022-03-01 16:56:06,921 INFO L78 Accepts]: Start accepts. Automaton has 17146 states and 33629 transitions. Word has length 589 [2022-03-01 16:56:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:06,921 INFO L470 AbstractCegarLoop]: Abstraction has 17146 states and 33629 transitions. [2022-03-01 16:56:06,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 17.135135135135137) internal successors, (634), 38 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 17146 states and 33629 transitions. [2022-03-01 16:56:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-01 16:56:06,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:06,926 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:56:06,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-01 16:56:07,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-01 16:56:07,128 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -208808955, now seen corresponding path program 2 times [2022-03-01 16:56:07,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:07,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457894731] [2022-03-01 16:56:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:56:08,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:08,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457894731] [2022-03-01 16:56:08,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457894731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:08,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059328594] [2022-03-01 16:56:08,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 16:56:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:08,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:08,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-01 16:56:10,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-01 16:56:10,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:56:10,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-01 16:56:10,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:56:11,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:56:11,470 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-01 16:56:11,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-03-01 16:56:11,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:56:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2022-03-01 16:56:11,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:11,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 16:56:11,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,847 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:11,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 16:56:11,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:11,898 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:11,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67 [2022-03-01 16:56:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-01 16:56:11,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:56:11,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059328594] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:56:11,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:56:11,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2022-03-01 16:56:11,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170685737] [2022-03-01 16:56:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:56:11,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 16:56:11,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:11,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 16:56:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-01 16:56:11,935 INFO L87 Difference]: Start difference. First operand 17146 states and 33629 transitions. Second operand has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:13,766 INFO L93 Difference]: Finished difference Result 46055 states and 91420 transitions. [2022-03-01 16:56:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 16:56:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 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 589 [2022-03-01 16:56:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:13,836 INFO L225 Difference]: With dead ends: 46055 [2022-03-01 16:56:13,836 INFO L226 Difference]: Without dead ends: 46055 [2022-03-01 16:56:13,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1338, Unknown=0, NotChecked=0, Total=1640 [2022-03-01 16:56:13,837 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 1128 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 2489 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:13,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1128 Valid, 2489 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-01 16:56:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2022-03-01 16:56:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 26239. [2022-03-01 16:56:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26239 states, 26184 states have (on average 2.0164604338527345) internal successors, (52799), 26238 states have internal predecessors, (52799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26239 states to 26239 states and 52799 transitions. [2022-03-01 16:56:14,380 INFO L78 Accepts]: Start accepts. Automaton has 26239 states and 52799 transitions. Word has length 589 [2022-03-01 16:56:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:14,381 INFO L470 AbstractCegarLoop]: Abstraction has 26239 states and 52799 transitions. [2022-03-01 16:56:14,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 19.90909090909091) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:14,381 INFO L276 IsEmpty]: Start isEmpty. Operand 26239 states and 52799 transitions. [2022-03-01 16:56:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-01 16:56:14,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:14,387 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:56:14,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-01 16:56:14,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:14,588 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -895811763, now seen corresponding path program 3 times [2022-03-01 16:56:14,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:14,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301412922] [2022-03-01 16:56:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:56:15,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:15,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301412922] [2022-03-01 16:56:15,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301412922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:15,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169718595] [2022-03-01 16:56:15,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 16:56:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:15,285 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:15,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-01 16:56:17,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-01 16:56:17,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:56:17,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-01 16:56:17,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:56:18,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:56:18,273 INFO L353 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-03-01 16:56:18,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2022-03-01 16:56:18,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:56:18,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2022-03-01 16:56:18,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,595 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:18,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-03-01 16:56:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,614 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:18,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 16:56:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:18,649 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:18,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 16:56:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2022-03-01 16:56:18,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 16:56:18,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169718595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 16:56:18,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 16:56:18,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-03-01 16:56:18,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234268749] [2022-03-01 16:56:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 16:56:18,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 16:56:18,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 16:56:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-03-01 16:56:18,682 INFO L87 Difference]: Start difference. First operand 26239 states and 52799 transitions. Second operand has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:20,051 INFO L93 Difference]: Finished difference Result 46138 states and 91586 transitions. [2022-03-01 16:56:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-01 16:56:20,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 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 589 [2022-03-01 16:56:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:20,122 INFO L225 Difference]: With dead ends: 46138 [2022-03-01 16:56:20,122 INFO L226 Difference]: Without dead ends: 46138 [2022-03-01 16:56:20,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-03-01 16:56:20,122 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 1094 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:20,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 1829 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-01 16:56:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46138 states. [2022-03-01 16:56:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46138 to 26263. [2022-03-01 16:56:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26263 states, 26208 states have (on average 2.0164453601953602) internal successors, (52847), 26262 states have internal predecessors, (52847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26263 states to 26263 states and 52847 transitions. [2022-03-01 16:56:20,592 INFO L78 Accepts]: Start accepts. Automaton has 26263 states and 52847 transitions. Word has length 589 [2022-03-01 16:56:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:20,592 INFO L470 AbstractCegarLoop]: Abstraction has 26263 states and 52847 transitions. [2022-03-01 16:56:20,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 21.9) internal successors, (219), 11 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26263 states and 52847 transitions. [2022-03-01 16:56:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-01 16:56:20,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:20,598 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:56:20,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-01 16:56:20,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-03-01 16:56:20,799 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash -361079955, now seen corresponding path program 4 times [2022-03-01 16:56:20,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:20,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344699651] [2022-03-01 16:56:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:56:21,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:21,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344699651] [2022-03-01 16:56:21,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344699651] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:21,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661699838] [2022-03-01 16:56:21,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 16:56:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:21,650 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:21,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-01 16:56:24,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 16:56:24,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 16:56:24,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 2175 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-01 16:56:24,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 16:56:25,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-01 16:56:25,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2022-03-01 16:56:25,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,950 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:25,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-03-01 16:56:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:25,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:25,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-03-01 16:56:26,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 16:56:26,038 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 16:56:26,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-03-01 16:56:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2022-03-01 16:56:26,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 16:56:27,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0))) is different from false [2022-03-01 16:56:29,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0) 0) (+ |c_~#slot~0.offset| 3 .cse0) 0) (+ |c_~#slot~0.offset| .cse0))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1 1))) 0))) is different from false [2022-03-01 16:56:30,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0))) is different from false [2022-03-01 16:56:31,505 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3)))))) is different from false [2022-03-01 16:56:31,565 INFO L353 Elim1Store]: treesize reduction 124, result has 23.5 percent of original size [2022-03-01 16:56:31,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-03-01 16:56:31,568 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 41 treesize of output 37 [2022-03-01 16:56:31,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2022-03-01 16:56:31,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,593 INFO L353 Elim1Store]: treesize reduction 40, result has 45.9 percent of original size [2022-03-01 16:56:31,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 62 [2022-03-01 16:56:31,596 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 41 treesize of output 37 [2022-03-01 16:56:31,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 16:56:31,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2022-03-01 16:56:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1855 trivial. 1 not checked. [2022-03-01 16:56:33,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661699838] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 16:56:33,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 16:56:33,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 32 [2022-03-01 16:56:33,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579380892] [2022-03-01 16:56:33,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 16:56:33,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-01 16:56:33,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 16:56:33,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-01 16:56:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=620, Unknown=4, NotChecked=228, Total=1056 [2022-03-01 16:56:33,612 INFO L87 Difference]: Start difference. First operand 26263 states and 52847 transitions. Second operand has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:35,201 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))))) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-01 16:56:35,977 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#slot~0.offset| .cse4 1))) (select (store (store (select (let ((.cse2 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse3 0)))) (store .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse2 |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse4) 0) (+ |c_~#slot~0.offset| 3 .cse4) 0) .cse3))) 0)) (= 0 (select (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (= |c_~#slot~0.offset| 0)) is different from false [2022-03-01 16:56:36,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_#t~malloc30#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3 1))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-01 16:56:37,308 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#slot~0.base|)) (.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (= (select .cse0 (+ |c_~#slot~0.offset| .cse1 1)) 0) (= |c_t_funThread1of1ForFork0_new_~p~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 1) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse2) 0) (+ |c_~#slot~0.offset| 3 .cse2) 0) (+ |c_~#slot~0.offset| .cse2 1))) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (store |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_new_~p~0#1.base|) |c_t_funThread1of1ForFork0_new_~p~0#1.offset| v_ArrVal_53094)) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse3) 0) (+ |c_~#slot~0.offset| 3 .cse3) 0) (+ |c_~#slot~0.offset| .cse3))) 0)) (= 0 (select .cse0 (+ |c_~#slot~0.offset| .cse1))) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-01 16:56:40,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)))) is different from false [2022-03-01 16:56:41,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (select (store (store (select (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1) 0)))) (store .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse0 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1) 0) (+ |c_~#slot~0.offset| 3 .cse1) 0) (+ |c_~#slot~0.offset| .cse1))) 0)) (not (= (+ |c_~#slot~0.offset| .cse2) 0)) (forall ((|t_funThread1of1ForFork0_new_~p~0#1.base| Int) (v_ArrVal_53094 Int)) (= 0 (let ((.cse5 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#slot~0.offset| .cse5 1))) (select (store (store (select (let ((.cse3 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse4 0)))) (store .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base| (store (select .cse3 |t_funThread1of1ForFork0_new_~p~0#1.base|) 0 v_ArrVal_53094))) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse5) 0) (+ |c_~#slot~0.offset| 3 .cse5) 0) .cse4))))) (not (= (+ |c_~#slot~0.offset| .cse2 1) 0)) (= |c_~#slot~0.offset| 0))) is different from false [2022-03-01 16:56:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 16:56:41,920 INFO L93 Difference]: Finished difference Result 136660 states and 278972 transitions. [2022-03-01 16:56:41,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-01 16:56:41,921 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 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 589 [2022-03-01 16:56:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 16:56:42,197 INFO L225 Difference]: With dead ends: 136660 [2022-03-01 16:56:42,197 INFO L226 Difference]: Without dead ends: 136660 [2022-03-01 16:56:42,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=709, Invalid=2401, Unknown=10, NotChecked=1170, Total=4290 [2022-03-01 16:56:42,198 INFO L933 BasicCegarLoop]: 711 mSDtfsCounter, 4008 mSDsluCounter, 6661 mSDsCounter, 0 mSdLazyCounter, 4649 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 7365 SdHoareTripleChecker+Invalid, 13837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 4649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8559 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-01 16:56:42,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4008 Valid, 7365 Invalid, 13837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 4649 Invalid, 0 Unknown, 8559 Unchecked, 2.7s Time] [2022-03-01 16:56:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136660 states. [2022-03-01 16:56:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136660 to 64021. [2022-03-01 16:56:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64021 states, 63966 states have (on average 2.0758371634931057) internal successors, (132783), 64020 states have internal predecessors, (132783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64021 states to 64021 states and 132783 transitions. [2022-03-01 16:56:44,493 INFO L78 Accepts]: Start accepts. Automaton has 64021 states and 132783 transitions. Word has length 589 [2022-03-01 16:56:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 16:56:44,493 INFO L470 AbstractCegarLoop]: Abstraction has 64021 states and 132783 transitions. [2022-03-01 16:56:44,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 16.25) internal successors, (520), 33 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 16:56:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64021 states and 132783 transitions. [2022-03-01 16:56:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2022-03-01 16:56:44,500 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 16:56:44,500 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 16:56:44,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-01 16:56:44,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-01 16:56:44,702 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-03-01 16:56:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 16:56:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -364683705, now seen corresponding path program 5 times [2022-03-01 16:56:44,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 16:56:44,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546757162] [2022-03-01 16:56:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 16:56:44,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 16:56:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 16:56:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2022-03-01 16:56:45,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 16:56:45,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546757162] [2022-03-01 16:56:45,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546757162] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 16:56:45,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971439556] [2022-03-01 16:56:45,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-01 16:56:45,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 16:56:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 16:56:45,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 16:56:45,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-03-01 17:06:02,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:06:02,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-01 17:06:04,058 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 [2022-03-01 17:06:04,167 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-03-01 17:06:04,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-03-01 17:06:04,210 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-01 17:06:04,211 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-01 17:06:04,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-03-01 17:06:04,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246322676] [2022-03-01 17:06:04,211 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-01 17:06:04,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 17:06:04,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 17:06:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 17:06:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-01 17:06:04,212 INFO L87 Difference]: Start difference. First operand 64021 states and 132783 transitions. Second operand has 13 states, 12 states have (on average 18.333333333333332) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 17:06:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 17:06:04,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-01 17:06:04,213 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 17:06:04,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 17:06:04,214 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2022-03-01 17:06:04,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-03-01 17:06:04,214 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2022-03-01 17:06:04,215 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-03-01 17:06:04,215 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-03-01 17:06:04,215 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-03-01 17:06:04,215 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (12 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-03-01 17:06:04,216 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-03-01 17:06:04,218 INFO L732 BasicCegarLoop]: Path program histogram: [28, 21, 15, 12, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 17:06:04,220 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 17:06:04,220 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 17:06:04,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 05:06:04 BasicIcfg [2022-03-01 17:06:04,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 17:06:04,222 INFO L158 Benchmark]: Toolchain (without parser) took 795123.28ms. Allocated memory was 186.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 133.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 339.2MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 186.6MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 661.20ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 136.4MB in the end (delta: -2.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.01ms. Allocated memory is still 186.6MB. Free memory was 136.4MB in the beginning and 132.6MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: Boogie Preprocessor took 57.93ms. Allocated memory is still 186.6MB. Free memory was 132.2MB in the beginning and 129.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: RCFGBuilder took 615.87ms. Allocated memory is still 186.6MB. Free memory was 128.7MB in the beginning and 101.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,222 INFO L158 Benchmark]: TraceAbstraction took 793720.64ms. Allocated memory was 186.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 100.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 306.8MB. Max. memory is 8.0GB. [2022-03-01 17:06:04,223 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.34ms. Allocated memory is still 186.6MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 661.20ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 136.4MB in the end (delta: -2.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.01ms. Allocated memory is still 186.6MB. Free memory was 136.4MB in the beginning and 132.6MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.93ms. Allocated memory is still 186.6MB. Free memory was 132.2MB in the beginning and 129.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.87ms. Allocated memory is still 186.6MB. Free memory was 128.7MB in the beginning and 101.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 793720.64ms. Allocated memory was 186.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 100.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 306.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1260]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1257]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1229]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1230]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1236]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while BasicCegarLoop was constructing difference of abstraction (64021states) and FLOYD_HOARE automaton (currently 2 states, 13 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 354 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 793.5s, OverallIterations: 101, TraceHistogramMax: 10, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.4s, AutomataDifference: 119.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71725 SdHoareTripleChecker+Valid, 92.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71725 mSDsluCounter, 314842 SdHoareTripleChecker+Invalid, 75.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12229 IncrementalHoareTripleChecker+Unchecked, 252999 mSDsCounter, 6015 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189617 IncrementalHoareTripleChecker+Invalid, 207861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6015 mSolverCounterUnsat, 62005 mSDtfsCounter, 189617 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8721 GetRequests, 6638 SyntacticMatches, 35 SemanticMatches, 2048 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12315 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64021occurred in iteration=100, InterpolantAutomatonStates: 1793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.9s AutomataMinimizationTime, 100 MinimizatonAttempts, 488637 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 62.2s InterpolantComputationTime, 50757 NumberOfCodeBlocks, 48910 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 52441 ConstructedInterpolants, 844 QuantifiedInterpolants, 149015 SizeOfPredicates, 82 NumberOfNonLiveVariables, 9835 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 117 InterpolantComputations, 95 PerfectInterpolantSequences, 183612/190869 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: Timeout Completed graceful shutdown